#include <iostream>
#include <vector>
#include <iomanip>
#include <algorithm>
#include <map>
#include <cmath>
#include <bitset>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <tuple>
#include <atcoder/all>
#include <sstream> // std::stringstream
#include <regex>
#include <fstream>
using namespace atcoder;
using mint = modint998244353;
//using mint = modint1000000007;
using namespace std;
using ll = long long;
static const double pi = 3.141592653589793;
const int INF = (1 << 29);
const ll mod = 998244353;
// ifstream ifs("");
template<class T> void print(T& a){cout<<a<<'\n';}

int main() {
    int n;
    cin >> n;
    vector Graph(n,vector<int>());
    for(int i=0;i<n-1;i++){
        int u,v;
        cin >> u >> v;
        u--;v--;
        Graph[u].push_back(v);
        Graph[v].push_back(u);
    }

    for(int i=0;i<n;i++){
        vector<int> visited(n,false);
        vector<int> dist(n,1e9);

        queue<int> que;
        que.push(i);
        set<int> S;
        dist[i]=0;
        while(!que.empty()){
            int now = que.front();que.pop();
            visited[now] = true;
            for(auto x:Graph[now]){
                if(visited[x]) continue;
                if(dist[now]+1==2) {
                    S.insert(x);
                    continue;
                }else if(dist[now]+1<2){
                    dist[x] = min(dist[x],dist[now]+1);
                    visited[x] = true;
                    que.push(x);
                }
            }
        }
        cout << S.size() << endl;


    }

}