#include<bits/stdc++.h>
using namespace std;
const long long MaxN = 1e5 + 5;
long long n, dp[MaxN];
vector<long long> a[MaxN];
void dfs(long long u, long long par)
{
for (long long v : a[u])
{
if(v==par) continue;
dfs(v,u);
dp[u]+=dp[v];
}
}
void input()
{
cin >> n;
for (long long i=1; i<n ;i++)
{
long long u,v;
cin >> u >> v;
a[u].push_back(v);
a[v].push_back(u);
}
}
void solve()
{
for (long long i=1; i<=n ;i++)
{
dp[i]=1;
}
dfs(1,-1);
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
input();
solve();
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKY29uc3QgbG9uZyBsb25nIE1heE4gPSAxZTUgKyA1Owpsb25nIGxvbmcgbiwgZHBbTWF4Tl07CnZlY3Rvcjxsb25nIGxvbmc+IGFbTWF4Tl07CnZvaWQgZGZzKGxvbmcgbG9uZyB1LCBsb25nIGxvbmcgcGFyKQp7CiAgICBmb3IgKGxvbmcgbG9uZyB2IDogYVt1XSkKICAgIHsKICAgICAgICBpZih2PT1wYXIpIGNvbnRpbnVlOwogICAgICAgIGRmcyh2LHUpOwogICAgICAgIGRwW3VdKz1kcFt2XTsKICAgIH0KfQp2b2lkIGlucHV0KCkKewogICAgY2luID4+IG47CiAgICBmb3IgKGxvbmcgbG9uZyBpPTE7IGk8biA7aSsrKQogICAgewogICAgICAgIGxvbmcgbG9uZyB1LHY7CiAgICAgICAgY2luID4+IHUgPj4gdjsKICAgICAgICBhW3VdLnB1c2hfYmFjayh2KTsKICAgICAgICBhW3ZdLnB1c2hfYmFjayh1KTsKICAgIH0KfQp2b2lkIHNvbHZlKCkKewogICAgZm9yIChsb25nIGxvbmcgaT0xOyBpPD1uIDtpKyspCiAgICB7CiAgICAgICAgZHBbaV09MTsKICAgIH0KICAgIGRmcygxLC0xKTsKfQppbnQgbWFpbigpCnsKICAgIGlvc19iYXNlOjpzeW5jX3dpdGhfc3RkaW8oMCk7CiAgICBjaW4udGllKDApOwogICAgaW5wdXQoKTsKICAgIHNvbHZlKCk7Cn0K