#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <cstring>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <stack>
#include <queue>

using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
static const double EPS = 1e-5;

#define FOR(i,k,n) for (int i=(k); i<(int)(n); ++i)
#define REP(i,n) FOR(i,0,n)

int main(void){
  int n;
  while(cin>>n){
    if(n==0) break;
    vector<int> a(n);
    REP(i,n) cin>>a[i];
    int k=0;
    bool itiro = true;
    int ohajiki = 32;
    while(1){
      if(ohajiki==0) break;
      if(itiro){
        ohajiki -= (ohajiki-1)%5;
        cout<<ohajiki<<endl;
        itiro = false;
      }else{
        ohajiki = max(0,ohajiki-a[k]);
        k = (k+1)%n;
        cout<<ohajiki<<endl;
        itiro = true;
      }
    }
  }

  return 0;
}