using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[] NMi => ReadLine().Split().Select(c => int.Parse(c) - 1).ToArray();
    static int[][] NMap(int n) => Enumerable.Repeat(0, n).Select(_ => NMi).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var n = NN;
        var map = NMap(n - 1);
        var tree = new List<int>[n];
        for (var i = 0; i < n; ++i) tree[i] = new List<int>();
        foreach (var edge in map)
        {
            tree[edge[0]].Add(edge[1]);
            tree[edge[1]].Add(edge[0]);
        }
        var dp0 = new int[n];
        var dp1 = new int[n];
        DFS(0, -1, tree, dp0, dp1);
        WriteLine(Math.Max(dp0[0], dp1[0]));
    }
    static void DFS(int cur, int prev, List<int>[] tree, int[] dp0, int[] dp1)
    {
        var haschild = false;
        foreach (var next in tree[cur])
        {
            if (next == prev) continue;
            DFS(next, cur, tree, dp0, dp1);
            haschild = true;
        }
        ++dp1[cur];
        if (!haschild)
        {
            return;
        }
        foreach (var next in tree[cur])
        {
            if (next == prev) continue;
            dp0[cur] += Math.Max(dp0[next], dp1[next]);
            dp1[cur] += dp0[next];
        }
    }
}