#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <valarray>
#include <vector>

#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(__typeof((X).begin()) it=(X).begin();it!=(X).end();it++)
#define ite iterator
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define sec second
#define sz(x) ((int)(x).size())

using namespace std;

struct timer{
	time_t start;
	timer(){start=clock();}
	~timer(){cerr<<1.*(clock()-start)/CLOCKS_PER_SEC<<" secs"<<endl;}
};

typedef istringstream iss;
typedef long long ll;
typedef pair<int,int> pi;
typedef stringstream sst;
typedef vector<int> vi;

int N,I[266],R[266],O[266],M=256;
int S,A,C;
double H;

int main(){
	cin.tie(0);
	ios_base::sync_with_stdio(0);
	
	while(cin>>N && N){
		rep2(i,1,N+1)cin>>I[i];
		H=INF;
		rep(s,16)rep(a,16)rep(c,16){
			R[0]=s;
			rep2(i,1,N+1)R[i]=(a*R[i-1]+c)%M;
			rep2(i,1,N+1)O[i]=(I[i]+R[i])%M;
			double res=0;
			double x[266]={};
			rep2(i,1,N+1)x[O[i]]++;
			rep(i,M)if(x[i])res-=x[i]/N*log2(x[i]/N);
			if(res<H-EPS){
				H=res;
				S=s,A=a,C=c;
			}
		}
		cout<<S<<" "<<A<<" "<<C<<endl;
	}
}