import std.conv, std.functional, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } int N; int[] U, V; int[][] G; int[][] dp; void dfs(int u, int p) { foreach (v; G[u]) { if (v != p) { dfs(v, u); } } dp[u] = [0, 1]; foreach (v; G[u]) { if (v != p) { dp[u][0] += max(dp[v][0], dp[v][1]); dp[u][1] += max(dp[v][0], dp[v][1] - 1); } } } void main() { try { for (; ; ) { N = readInt(); U = new int[N - 1]; V = new int[N - 1]; foreach (i; 0 .. N - 1) { U[i] = readInt() - 1; V[i] = readInt() - 1; } G = new int[][N]; foreach (i; 0 .. N - 1) { G[U[i]] ~= V[i]; G[V[i]] ~= U[i]; } dp = new int[][](N, 2); const rt = 0; dfs(rt, -1); const ans = max(dp[rt][0], dp[rt][1]); writeln(ans); } } catch (EOFException e) { } }