#include <bits/stdc++.h>
int size;
bool remain[80][80];
void initialize(int n) {
assert(n <= 80);
size = n;
for (int i = 0; i < size; ++i) {
for (int j = 0; j < size; ++j) {
remain[i][j] = (i != j);
}
}
}
struct DSU {
std::vector<int> par;
DSU(const int n): par(n, -1) { }
int find(const int u) {
return par[u] < 0 ? u : par[u] = find(par[u]);
}
bool merge(int u, int v) {
u = find(u);
v = find(v);
if (u == v) {
return false;
}
if (par[u] > par[v]) {
std::swap(u, v);
}
par[u] += par[v];
par[v] = u;
return true;
}
};
bool isConnected() {
int cnt = 0;
DSU dsu(size);
for (int i = 0; i < size; ++i) {
for (int j = 0; j < size; ++j) {
if (remain[i][j]) {
if (dsu.merge(i, j)) {
cnt += 1;
}
}
}
}
return cnt == (size - 1);
}
int hasEdge(int u, int v) {
remain[u][v] = remain[v][u] = false;
if (isConnected()) {
return 0;
}
else {
remain[u][v] = true;
return 1;
}
}
#ifdef __APPLE__
int main() {
int n;
std::cin >> n;
initialize(n);
for (int i = 0; i < n; ++i) {
for (int j = 0; j < i; ++j) {
int u, v;
std::cin >> u >> v;
std::cout << hasEdge(u, v) << '\n';
}
}
}
#endif
