1. 1
2. 2
3. 3
4. 4
5. 5
6. 6
7. 7
8. 8
9. 9
10. 10
11. 11
12. 12
13. 13
14. 14
15. 15
16. 16
17. 17
18. 18
19. 19
20. 20
21. 21
22. 22
23. 23
24. 24
25. 25
26. 26
27. 27
28. 28
29. 29
30. 30
31. 31
32. 32
33. 33
34. 34
35. 35
36. 36
37. 37
38. 38
39. 39
40. 40
41. 41
42. 42
43. 43
44. 44
45. 45
46. 46
47. 47
48. 48
49. 49
50. 50
51. 51
52. 52
53. 53
54. 54
55. 55
56. 56
57. 57
58. 58
59. 59
60. 60
61. 61
62. 62
63. 63
64. 64
65. 65
66. 66

#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
typedef pair<int, int> ii;

int d[100001] = { 0 };
vector<ii> G[100001];

ii dfs(int u, int p) {
	d[u] = d[p] + 1;
	vector<ii> tmp;
	for (auto& x : G[u]) {
		if (!d[x.f] || d[x.f] > d[u]) tmp.push_back(x);
	}
	swap(G[u], tmp);
	if (G[u].size() == 1) {
		G[u][0] = dfs(G[u][0].f, u);
		return ii(G[u][0].f, G[u][0].s + 1);
	}
	else if (!G[u].empty()) {
		int tmp = 0;
		for (auto& v : G[u]) v = dfs(v.f, u);
	}
	return ii(u, 1);
}

int solve(int u, int k) {
	unordered_multiset<int> S;
	for (auto& v : G[u]) {
		int x = solve(v.f, k) + v.s;
		if (x < 0) return -1e9;
		if (x % k) S.insert(x % k);
	}
	int ret = 0;
	while (!S.empty()) {
		int x = *begin(S);
		S.erase(S.find(x));
		auto it = S.find(k - x);
		if (it == end(S)) {
			if (ret) return -1e9;
			ret = x;
		}
		else S.erase(it);
	}
	return ret;
}

int main() {
	ifstream cin("deleg.in");
	ofstream cout("deleg.out");
	ios_base::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);

	int N; cin >> N;
	for (int i = 1; i < N; ++i) {
		int a, b; cin >> a >> b;
		G[a].emplace_back(b, 1), G[b].emplace_back(a, 1);
	}
	int s = 1;
	for (int u = 1; u <= N; ++u) {
		if (G[u].size() > G[s].size()) s = u;
	}
	dfs(s, 0);
	for (int i = 1; i < N; ++i) cout << ((N - 1) % i == 0 ? solve(s, i) == 0 : 0);
}