#include <cstdio>
#include <vector>
#include <algorithm>
#include <cmath>
#include <utility>

using namespace std;

int F[11];
vector < pair < int, int > > v;

int main ( void ){
    
    for( int i = 0; i < 10; ++i ) scanf( "%d", F + i );
    int tmp = F[0];
    v.push_back( make_pair( abs(tmp-100), tmp ));
    for( int i = 1; i < 10; ++i ){
              tmp += F[i];
              v.push_back( make_pair(abs(tmp-100), tmp ));
    }
    sort( v.begin(), v.end() );
    if( v[0].first == v[1].first ){
        if( v[0].second > v[1].second ){
            printf( "%d\n", v[0].second );
            return 0;
        }
        if( v[0].second < v[1].second ){
            printf( "%d\n", v[1].second );
            return 0;
        }
    }
    printf( "%d\n", v[0].second );
    return 0;   
}