#include <iostream>
#include <vector>
using namespace std;
const int N = 10005;
vector<int> e[N];
int n, u, v, demon[N];
void dfs(int u){
    for(int i=0;i<e[u].size();i++){
        v=e[u][i];
        demon[v]=demon[u]+1;
        dfs(v);
    }
}
int main()
{
    cin >> n;
    for (int i = 1; i <= n - 1; i++)
    {
        cin >> u >> v;
        e[u].push_back(v);
    }
    demon[1]=0;
    dfs(1);
    for(int i=1;i<=n;i++){
        if(demon[i]%3==2){
            cout<<i<<" ";
        }
    }
    return 0;
}