#include <iostream>
#include <memory>
#include <memory.h>
#include <cmath>
#include <fstream>
#include <cmath>
#include <numeric>
#include <vector>
#include <stack>
#include <string>
#include <queue>
#include <sstream>
#include <cstdlib>
#include <cassert>
#include <cstdio>
#include <map>
#include <iomanip>
#include <list>
#include <cctype>
#include <algorithm>
#include <complex>
#define USE_MATH_DEFINES
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, m, n) for(int i = m; i < n; i++)
using namespace std;

typedef complex<double> xy_t;
typedef pair<xy_t, xy_t> line;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> PP;
typedef pair<int, PP> PPP;
const int INF = 1 << 29;
const double EPS = 1E-10;

int nums[100];

int main(){
	int n;
	int c, pos;
	bool turn;
	while(cin >> n && n){
		turn = true;
		pos = 0;
		c = 32;
		rep(i, n)cin >> nums[i];
		while(c > 0){
			if(turn){
				c -= (c-1)%5;
			}else{
				c -= nums[pos];
				pos = (pos+1)%n;
			}
			cout << max(c, 0) << endl;
			turn = !turn;
		}
	}
	return 0;
}