#include <bits/stdc++.h>
using namespace std;
int main() {
    int n; cin>>n;
    if (n==1) { cout<<1<<"\n"; return 0; }
    vector<vector<int>> adj(n+1); vector<int> deg(n+1,0);
    for (int i=0;i<n-1;i++) {
        int u,v; cin>>u>>v;
        adj[u].push_back(v); adj[v].push_back(u); deg[u]++; deg[v]++;
    }
    queue<int> leaves;
    for (int i=1;i<=n;i++) if (deg[i]==1) leaves.push(i);
    int rem=n;
    while (rem>2) {
        int sz=leaves.size(); rem-=sz;
        for (int i=0;i<sz;i++) {
            int u=leaves.front(); leaves.pop();
            for (int v:adj[u]) if (--deg[v]==1) leaves.push(v);
        }
    }
    vector<int> ans;
    while (!leaves.empty()) { ans.push_back(leaves.front()); leaves.pop(); }
    sort(ans.begin(),ans.end());
    for (int i=0;i<(int)ans.size();i++) cout<<ans[i]<<(i+1==(int)ans.size()?"\n":" ");
}