#include <bits/stdc++.h>

 using namespace std;

 typedef long long ll;

 const int N = ;

 vector<int> G[N];

 ll cnt[N], dp[N];

 int n;

 void dfs(int u, int p)

 {

     cnt[u] = ;

     for (int i = ; i < G[u].size(); i++)

     {

         int t = G[u][i];

         if (t == p) continue;

         dfs(t, u);

         cnt[u] += cnt[t];

         dp[u] += dp[t];

     }

     dp[u] += cnt[u];

 }

 void dfs2(int u, int p, ll x, ll& ans)

 {

     ans = max(ans, dp[u] - cnt[u] + x + n);

     for (int i = ; i < G[u].size(); i++)

     {

         int t = G[u][i];

         if (t == p) continue;

         dfs2(t, u, dp[u] - cnt[u] - dp[t] + x + n - cnt[t], ans);

     }

 }

 int main()

 {

     int a, b;

     while (cin >> n)

     {

         for (int i = ; i <= n; i++) G[i].clear();

         memset(cnt, , sizeof cnt); memset(dp, , sizeof dp);

         for (int i = ; i <= n - ; i++)

         {

             cin >> a >> b;

             G[a].push_back(b); G[b].push_back(a);

         }

         dfs(, );

         ll maxn = dp[];

         for (int i = ; i < G[].size(); i++)

         {

             int t = G[][i];

             dfs2(t, , dp[] - dp[t] - cnt[t], maxn);

         }

         cout << maxn << endl;

     }

     return ;

 }