using System; using System.IO; using System.Collections.Generic; namespace No763 { public class Program { class Node { public List Children = new List(); public int MaxDel = 0; public int MaxLev = 1; } void Solve(StreamScanner ss, StreamWriter sw) { //--------------------------------- var N = ss.Next(int.Parse); var nodes = new Node[N + 1]; for (var i = 1; i <= N; i++) { nodes[i] = new Node(); } for (var i = 0; i < N - 1; i++) { var u = ss.Next(int.Parse); var v = ss.Next(int.Parse); nodes[u].Children.Add(v); nodes[v].Children.Add(u); } void DFS(int i) { var p = nodes[i]; foreach (var ci in p.Children) { var c = nodes[ci]; c.Children.Remove(i); DFS(ci); p.MaxDel += Math.Max(c.MaxDel, c.MaxLev); p.MaxLev += Math.Max(c.MaxDel, c.MaxLev - 1); } } DFS(1); var root = nodes[1]; sw.WriteLine(Math.Max(root.MaxDel, root.MaxLev)); //--------------------------------- } static void Main() { var ss = new StreamScanner(new StreamReader(Console.OpenStandardInput())); var sw = new StreamWriter(Console.OpenStandardOutput()) {AutoFlush = false}; new Program().Solve(ss, sw); sw.Flush(); } static readonly Func String = s => s; } public class StreamScanner { static readonly char[] Sep = {' '}; readonly Queue buffer = new Queue(); readonly TextReader textReader; public StreamScanner(TextReader textReader) { this.textReader = textReader; } public T Next(Func parser) { if (buffer.Count != 0) return parser(buffer.Dequeue()); var nextStrings = textReader.ReadLine().Split(Sep, StringSplitOptions.RemoveEmptyEntries); foreach (var nextString in nextStrings) buffer.Enqueue(nextString); return Next(parser); } public T[] Next(Func parser, int x) { var ret = new T[x]; for (var i = 0; i < x; ++i) ret[i] = Next(parser); return ret; } public T[][] Next(Func parser, int x, int y) { var ret = new T[y][]; for (var i = 0; i < y; ++i) ret[i] = Next(parser, x); return ret; } } }