#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <math.h>
#include <assert.h>
#include <vector>

using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
static const double EPS = 1e-9;
static const double PI = acos(-1.0);

#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)
#define FOREQ(i, s, n) for (int i = (s); i <= (int)(n); i++)
#define FORIT(it, c) for (__typeof((c).begin())it = (c).begin(); it != (c).end(); it++)
#define MEMSET(v, h) memset((v), h, sizeof(v))

int cnt[300];
int input[300];

int main() {
  int n;
  while (scanf("%d", &n), n) {
    REP(i, n) { scanf("%d", &input[i]); }
    double ansmin = 1e+10;
    int anss, ansa, ansc;
    REP(s, 16) REP(a, 16) REP(c, 16) {
      MEMSET(cnt, 0);
      int r = s;
      REP(i, n) {
        r = (a * r + c) % 256;
        int o = (r + input[i]) % 256;
        cnt[o]++;
      }
      double h = 0.0;
      REP(i, 256) {
        if (cnt[i] == 0) { continue; }
        h -= cnt[i] / (double)n * log(cnt[i] / (double)n);
      }
      if (h - ansmin < -EPS) {
        ansmin = h;
        anss = s;
        ansa = a;
        ansc = c;
      }
    }
    printf("%d %d %d\n", anss, ansa, ansc);
  }
}