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

signed main(){
  int N; cin >> N;
  vector< int > M( N );
  for( int i = 0; i < N; ++i )
    cin >> M[ i ];
  vector< int > dp( 1 << N, 0x3f3f3f3f );
  dp[ 0 ] = 0;
  for( int i = 0; i < 1 << N; ++i )
    if( dp[ i ] < 0x3f3f3f3f ){
      int s = 0;
      for( int j = 0; j < N; ++j )
        if( i >> j & 1 )
          s += M[ j ];
      for( int j = 0; j < N; ++j )
        if( ~i >> j & 1 )
          dp[ i | 1 << j ] = min( dp[ i | 1 << j ], dp[ i ] + max( 0, M[ j ] - s % 1000 ) );
    }
  cout << dp[ ( 1 << N ) - 1 ] << endl;
  return 0;
}