#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n;
    
    while (scanf("%d", &n) && n){
        int I[257];
        
        for (int i = 1; i <= n; i++) scanf("%d", I + i);
        
        pair<int, pair<int, int> > res = make_pair(20, make_pair(20, 20));
        double mini = 1e30;
        for (int S = 0; S <= 15; S++){
            for (int A = 0; A <= 15; A++){
                for (int C = 0; C <= 15; C++){
                    int R[257];
                    int occ[256] = {0};
                    R[0] = S;
                    for (int i = 1; i <= n; i++){
                        R[i] = (A * R[i - 1] + C) % 256;
                    }
                    
                    for (int i = 1; i <= n; i++){
                        occ[(I[i] + R[i]) % 256]++;
                    }
                    
                    double H = 0;
                    for (int i = 0; i < 256; i++){
                        if (occ[i] != 0){
                            double X = occ[i] * 1.0 / n;
                            H -= X * log2(X);
                        }
                    }
                    if (H - mini < -1e-10){
                        res = make_pair(S, make_pair(A, C));
                        mini = H;
                    }
                }
            }
        }
        
        printf("%d %d %d\n", res.first, res.second.first, res.second.second);
    }
    
    return (0);
}