#include <bits/stdc++.h>
#include <math.h>
			
using namespace std;

// c++ short types
#define Int long long
#define vt vector

inline int read() {
	bool minus = false;
	int result = 0;
	char ch = getchar();
	while(true) {
		if(ch == '-') break;
		if(ch >= '0' && ch <= '9') break;
		ch = getchar();
	}
	if(ch == '-') minus = true;
	else result = ch - '0';
	while(true) {
		ch = getchar();
		if(ch < '0' || ch > '9') break;
		result = result * 10 + (ch-'0');
	}
	return (minus ? -result : result);
}

bool debug = false;

void solver() {
	int n; cin >> n;
	if(debug) {
		n = 1e6;
	}
	vt<vt<int>> g(n);
	for(int i = 1; i < n; ++i) {
		int a, b; 
		if(debug) {
			a = rand() % i + 1, b = i + 1;
		} else {
			a = read(), b = read();
		}
		g[--a].push_back(--b);
		g[b].push_back(a);
	}
	vt<int> order, parent(n, -1);
	queue<int> q;
	q.push(0);
	while(not q.empty()) {
		int u = q.front(); q.pop(); order.push_back(u);
		for(int to: g[u]) if(to ^ parent[u]) {
			q.push(to);
			parent[to] = u;
		}
	}
	reverse(order.begin(), order.end());
	vt<int> sz(n, 0);
	auto check = [&](int x) -> bool {
		for(int i: order) {
			sz[i] = 1;
			for(int from: g[i]) if(from ^ parent[i]) {
				sz[i] += sz[from];
			}
			if(sz[i] >= x) {
				if(sz[i] != x) {
					return 0;
				}
				sz[i] = 0;
			}
		}
		return sz[0] == 0;
	};
	for(int d = 1; d <= n-1; ++d) {
		if(n % (d+1) == 0 && check(n/(d+1))) {
			cout << d << " ";
		}
	}
}

int main()
{
//	ios::sync_with_stdio(false);
	//cin.tie(nullptr);
	int tt = 1;
	for(int t = 0; t < tt; ++t) {
    solver();
	}
	return 0;
}