#include <iostream>
#include <algorithm>
#include <vector>
#include <functional>
#include <numeric>
#include <iterator>
#include <cstdlib>

using namespace std;
typedef vector<int> vint;
#define TESTER(b)
//(cout<<__LINE__<<"@"<<b<<endl)
int main(void)
{
    vint ar;
    int input;
    cin>>input;
    while(cin>>input)
        ar.push_back(input);
    sort(ar.begin(), ar.end(), greater<int>());
    
    int sum = accumulate(ar.begin(), ar.end(), 0);
    int record=sum;
    int i;
    int size=(int)ar.size();
    vint taken(ar.size(),1);
    while ( taken[0]!=0 ){
        int cur_sum=0;
        for ( i=0 ; i<size && cur_sum*2<sum ; i++ ) {
            if ( taken[i]!=0 )
                cur_sum+=ar[i];
        }
        int diff = abs(sum-cur_sum*2);
        if ( diff<record ){
            record=diff;
            //copy(taken.begin(), taken.end(), ostream_iterator<int>(cout,","));
            TESTER(record<<" "<<i);
        }
        if ( i<size ) {
            cur_sum -= ar[i-1];
            
            taken[i-1]=0;
            fill(taken.begin()+i,taken.end(), 1);
        }
        else{
            vint::reverse_iterator it;
            if ( (it=find(taken.rbegin(), taken.rend(), 1))!=taken.rend() ) {
                *it=0;
                fill(taken.rbegin(), it, 1);
            }
            else{
                break;
            }
        }
    }
    cout<<record<<endl;
}