#ifndef INCLUDED_MAIN
#define INCLUDED_MAIN

#include __FILE__

using namespace nskr;


int main(void){
    int t, u=0;
    int q=7;
    for(;q--;){
        cin >> t; if(t==-1) t = 60000;
        u+=t;
        cout << (6000-u < 0? -1 : 6000-u) << "\n";
    }
}

#else
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ld=  long double;
#define rep(i,n) for(i=0;i<(n);i++)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()

namespace nskr{
    
    struct unionfind{
        //unionfind - union by size, 経路圧縮
        vector<int> pr, sz;
        unionfind(int n){
            pr.resize(n);
            sz.resize(n,1);
            for(int i=0;i<n;i++) pr[i] = i;
        }

        inline int find(int x){ 
            while(pr[x] != x){ 
                pr[x] = pr[pr[x]];
                x = pr[x];
            }
            return x;
        }
        
        inline void merge(int p, int q){ 
            p = find(p); q = find(q);
            if(p==q) return ;
            if(sz[p] < sz[q]) swap(p,q);
            pr[q] = p;
            sz[p] += sz[q];
            return ;
        }

        inline bool same(int p, int q){
            if(find(p) == find(q)) return true;
            return false;
        }

        int size(int x){
            return sz[find(x)];
        }
    };
}

int randint(int a, int b){
    static mt19937 gen(chrono::steady_clock::now().time_since_epoch().count());
    uniform_int_distribution<int> dist(a,b);
    return dist(gen);
}


#endif