#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9 + 7;
const int N = 1e3;
const int M = 1e3;
int binpow(int a, int b, int mod)
{
int ans = 1;
while (b)
{
if (b & 1) ans = (ans * a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return ans;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int v;
cin >> v;
vector<pair<int , int>> x(v + 1);
for(int i = 1; i <= v ; i++)
{
cin >> x[i].first >> x[i].second;
}
for(int i = 1; i <= v - 1; i++) cout << 1 << endl;
cout << 2 << endl;
}
