#include <cmath>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <list>
#include <time.h>
#include <math.h>
#include <random>
#include <deque>
#include <queue>
#include <cassert>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <bitset>
#include <sstream>
#include <chrono>
#include <cstring>
#include <string>
#include <fstream>
#include <list>
#include <numeric>

using namespace std;

#define mp make_pair
#define pb push_back
#define sz(x) ((int)((x).size()))
#define X first
#define Y second
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef unsigned long long ull;


int main()
{
    vector<pair<int, int>> a;
    a.pb(mp(5, 9));
    a.pb(mp(5, 6));
    a.pb(mp(10, 8));
    a.pb(mp(6, 10));
    a.pb(mp(8, 7));
    a.pb(mp(4, 6));
    a.pb(mp(7, 8));
    a.pb(mp(6, 5));
    a.pb(mp(6, 4));
    a.pb(mp(5, 8));
    a.pb(mp(9, 6));
    for (int i = 1; i <= 50; ++i) {
        vector<pair<int, int>> kek;
        kek = a;
        kek.pb(mp(6, i));
        bool c = true;
        int ans1 = 0, ans2 = 0;
        for (int j = 0; j < 6; ++j) {
            if (c) {
                sort(all(kek), [](pair<int, int> i, pair<int, int> j) { return i.first < j.first; });
                ans1 += kek.back().first;
                kek.pop_back();
                ans1 += kek.back().first;
                kek.pop_back();
            }
            else {
                sort(all(kek), [](pair<int, int> i, pair<int, int> j) { return i.second < j.second; });
                ans2 += kek.back().second;
                kek.pop_back();
                ans2 += kek.back().second;
                kek.pop_back();
            }
            c = !c;
        }
        if (ans2 - ans1 == 1)
            cout << i << endl;
    }
}