#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cassert>
#include <vector>
#include <string>
#include <cmath>
#include <map> 
#include <sstream>
#include <cstdio>
#include <complex>
#include <cstring>
using namespace std;
 
const int MAX= 10000100;

#define loop(i,a,b) for(int i = a ; i < b ; i ++)
#define rep(i,a) loop(i,0,a)
#define all(a) (a).begin(),(a).end()
#define ll long long int
#define gcd(a,b) __gcd(a,b)
#define pb(a) push_back(a)
int GCD(int a, int b) {if(!b) return a; return gcd(b, a%b);}
int lcm(int a, int b) {return a*b / gcd(a, b);}

int main(void){
  int n;
  while(cin>>n,n){
    vector<int> a(n);
    rep(i,n)cin>>a[i];
    int b = 31;
  
    int i = 0;
    cout<<b<<endl;
    while(b-a[i]>0){
      b -= a[i];
      i=(i+1)%n;
      cout<<b<<endl;
      if(b-(b-1)%5<=0)break;
      b -= (b-1)%5;
      cout<<b<<endl;
    }
    cout<<0<<endl;
  }
}