#pragma GCC optimize(2) 
#include <bits/stdc++.h>
#define pb push_back

using namespace std;

typedef long long LL;

const int maxn = 1e6 + 5;

vector<int> E[maxn];
int fl, n;


int dfs(int x, int fr, int y)
{
	if(!fl)
		return 0;
	int res = 1;
	for(auto &v : E[x]){
		if(v == fr)
			continue;
		res += dfs(v, x, y);
	}
//	cout << x << " " << fr << " " << y << " " << res << endl; 
	if(res <= y)
		return (res == y ? 0 : res);
	else{
		fl = 0;
		return res;
	}
	
}

inline int read(){
	int x=0,f=1;char ch=' ';
	while(ch<'0' || ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0' && ch<='9'){x=(x<<3)+(x<<1)+(ch^48);ch=getchar();}
	return f==1?x:-x;
}

int main()
{
	n = read();
	for(int i = 1; i < n; ++i){
		int a, b;
		a = read(), b = read();
		E[a].pb(b), E[b].pb(a);
	}
	
	vector<int> ans;
	for(int i = 1; i <= n; ++i){
		if(!(n % (i + 1))){
			fl = 1;
			dfs(1, 0, n / (i + 1));
			if(fl)
				ans.pb(i);
		}
	}
	
	for(int i = 0; i < ans.size(); ++i){
		printf("%d", ans[i]);
		if(i != ans.size() - 1)
			printf(" ");
	}
	return 0;
	
}