#include <iostream>

using namespace std;
int a[100001],n,b,l=100001,r=0,xid=2;
int main()
{cin>>n;
for (int i=1;i<=n;i++) {cin>>b; a[b]++;l=min(l,b);r=max(r,b);}
while (a[l]+a[r]<n) if (a[l]<a[r]) {a[l+1]+=a[l]; a[l]=0; l++; if (a[l]+a[r]==n) {break;xid=1;}} else
                                     {a[r-1]+=a[r]; a[r]=0; r--; if (a[r]+a[l]==n) {break;xid=2;}}
                                     cout<<xid<<" "<<l<<" "<<r<<endl;

    return 0;
}