/*DavitMarg*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stack>
#include <cassert>
#include <iterator>
#include <fstream>
#define mod 1000000007ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
#define all(v) v.begin(), v.end()
using namespace std;
#ifndef death
#include "game.h"
#endif
const int N = 5003;
int p[N], sz[N], s[N], n, comp, k;
int par(int v)
{
if (p[v] == v)
return v;
return p[v] = par(p[v]);
}
void dsu(int a, int b)
{
a = par(a);
b = par(b);
if (a == b)
return;
if (sz[b] > sz[a])
swap(a, b);
sz[a] += sz[b];
s[a] += s[b];
comp--;
p[b] = a;
}
void initialize(int x)
{
n = comp = x;
k = n * (n - 1) / 2;
for (int i = 1; i <= n; i++)
{
sz[i] = 1;
p[i] = i;
}
}
int hasEdge(int u, int v)
{
int ans = 0;
if (par(u) == par(v))
ans = 0;
else if (comp == 2)
ans = 0;
else if ((sz[par(u)] * (n - sz[par(u)]) == s[par(u)] - 1) || (sz[par(v)] * (n - sz[par(v)]) == s[par(v)] - 1))
ans = 1;
else if (k == comp - 1)
ans = 1;
else if (rand() % 3 == 0)
ans = 1;
if (ans)
dsu(u, v);
else
{
s[par(u)]++;
s[par(v)]++;
}
k--;
return ans;
}
#ifdef death
int main()
{
int N;
cin >> N;
initialize(N);
N = N * (N - 1) / 2;
while (N--)
{
int a, b;
cin >> a >> b;
cout << hasEdge(a, b) << endl;
}
return 0;
}
#endif
/*
*/
