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

public class Prog
{
    private const int INF = 1000000007;
    private const long INFINITY = 9223372036854775807;
    private struct Pair { public int x, y; public Pair(int xx, int yy) { x = xx; y = yy; } }
    private static int[] dx = { 1, 0, -1, 0 };
    private static int[] dy = { 0, -1, 0, 1 };
    public static void Main()
    {
        int N = NextInt();
        Node[] nodes = new Node[N];
        for (int i = 0; i < N; i++) nodes[i] = new Node(i);
        for (int i = 0; i < N - 1; i++)
        {
            int a = NextInt() - 1;
            int b = NextInt() - 1;
            nodes[a].relate.Add(new Edge(b));
            nodes[b].relate.Add(new Edge(a));
        }
        //0からの最遠点探す
        Queue<int> Q = new Queue<int>();
        Q.Enqueue(0);
        int LastPoint = 0;
        while (Q.Count() != 0)
        {
            int now = Q.Dequeue();
            LastPoint = now;
            nodes[now].visit = true;
            foreach (var nx in nodes[now].relate)
            {
                if (!nodes[nx.to].visit)
                {
                    nodes[nx.to].cost = nodes[now].cost + 1;
                    Q.Enqueue(nx.to);
                }
            }
        }

        //LastPointから最遠点探す
        for (int i = 0; i < N; i++)
        {
            nodes[i].cost = 0;
            nodes[i].visit = false;
        }
        Q = new Queue<int>();
        Q.Enqueue(LastPoint);
        nodes[LastPoint].cost = 1;
        long Diameter = 1;
        while (Q.Count() != 0)
        {
            int now = Q.Dequeue();
            nodes[now].visit = true;
            foreach (var nx in nodes[now].relate)
            {
                if (!nodes[nx.to].visit)
                {
                    nodes[nx.to].cost = nodes[now].cost + 1;
                    Diameter = Math.Max(Diameter, nodes[nx.to].cost);
                    Q.Enqueue(nx.to);
                }
            }
        }

        //[直径] = T -> 先手の勝ち
        bool[] ans = new bool[N + 1];
        ans[0] = true;
        ans[1] = true;
        //端を取ると直径が1減る、中をとると直径が2減る
        //自分の勝利✋にしかつなげられない場合は後攻が勝つ
        for (int i = 2; i <= N; i++)
            ans[i] = (ans[i - 1] && ans[i - 2] ? false : true);
        Console.WriteLine((ans[Diameter] ? "First" : "Second"));
    }
}

public class Node
{
    public List<Edge> relate = new List<Edge>();
    public int name = 0;
    public bool visit = false;
    public long cost = 0;
    public Node(int name) { this.name = name; }
}
public class Edge
{
    public int to;
    public long cost;
    public Edge(int to) { this.to = to; }
}

public class Input
{
    private static Queue<string> q = new Queue<string>();
    private static void Confirm() { if (q.Count == 0) foreach (var s in Console.ReadLine().Split(' ')) q.Enqueue(s); }
    public static int NextInt() { Confirm(); return int.Parse(q.Dequeue()); }
    public static long NextLong() { Confirm(); return long.Parse(q.Dequeue()); }
    public static char NextChar() { Confirm(); return char.Parse(q.Dequeue()); }
    public static string NextString() { Confirm(); return q.Dequeue(); }
    public static double NextDouble() { Confirm(); return double.Parse(q.Dequeue()); }
    public static int[] LineInt() { return Console.ReadLine().Split(' ').Select(int.Parse).ToArray(); }
    public static long[] LineLong() { return Console.ReadLine().Split(' ').Select(long.Parse).ToArray(); }
    public static string[] LineString() { return Console.ReadLine().Split(' ').ToArray(); }
    public static double[] LineDouble() { return Console.ReadLine().Split(' ').Select(double.Parse).ToArray(); }
}


Measured memory_bytes: 62924