vp2

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

int main() {


    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int n;
    cin >> n;
    vector <vector <int>> data(n, vector<int>(2));
    vector <bool> ans(n);
    int min = 100009, count = 0;

    for (int i = 0; i < n; ++i) {
        int s1, s2;
        cin >> s1 >> s2;

        data[i][0] = s1;
        data[i][1] = s2;
    }

    for (int i = 0; i < (1 << n); ++i) {
        vector <bool> spec(n);
        int count1 = 0, count2 = 0;
        for (int j = 0; j < n; ++j) {
            bool curr = (i & (1 << j)) != 0;
            spec[j] = curr;
            if (curr == 0)
                count1 += data[j][curr];
            else
                count2 += data[j][curr];
        }
        count = max(count1, count2);

        if (count < min) {
            min = count;
            for (int k = 0; k < n; ++k)
                ans[k] = spec[k];
        }
    }
    for (int i = 0; i < n; ++i)
        cout << (int)ans[i] + 1 << " ";

    return 0;
}