Problem:
Score : 800 points

Problem Statement

Takahashi and Aoki will play a game on a tree.
The tree has N vertices numbered 1 to N, and the i-th of the N-1 edges connects Vertex a_i and Vertex b_i.

At the beginning of the game, each vertex contains a coin.
Starting from Takahashi, he and Aoki will alternately perform the following operation:

Choose a vertex v that contains one or more coins, and remove all the coins from v.

Then, move each coin remaining on the tree to the vertex that is nearest to v among the adjacent vertices of the coin's current vertex.

The player who becomes unable to play, loses the game.
That is, the player who takes his turn when there is no coin remaining on the tree, loses the game.
Determine the winner of the game when both players play optimally.

Constraints

1 \leq N \leq 2 \times 10^5

1 \leq a_i, b_i \leq N

a_i \neq b_i

The graph given as input is a tree.

Input

Input is given from Standard Input in the following format:

N
a_1 b_1
a_2 b_2
:
a_{N-1} b_{N-1}

Output

Print First if Takahashi will win, and print Second if Aoki will win.

Sample Input 1

3
1 2
2 3

Sample Output 1

First

Here is one possible progress of the game:

Takahashi removes the coin from Vertex 1. Now, Vertex 1 and Vertex 2 contain one coin each.

Aoki removes the coin from Vertex 2. Now, Vertex 2 contains one coin.

Takahashi removes the coin from Vertex 2. Now, there is no coin remaining on the tree.

Aoki takes his turn when there is no coin on the tree and loses.

Sample Input 2

6
1 2
2 3
2 4
4 6
5 6

Sample Output 2

Second

Sample Input 3

7
1 7
7 4
3 4
7 5
6 3
2 1

Sample Output 3

First

Solution in Rust (1.15.1) (judge verdict: Accepted)

macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        let mut next = || { iter.next().unwrap() };
        input_inner!{next, $($r)*}
    };
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String {
            bytes
                .by_ref()
                .map(|r| r.unwrap() as char)
                .skip_while(|c| c.is_whitespace())
                .take_while(|c| !c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };

    ($next:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, [ $t:tt ]) => {
        {
            let len = read_value!($next, usize);
            (0..len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
        }
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

use std::collections::{BTreeSet, BTreeMap};
use std::cmp::max;

fn main() {
    input!{
        n: usize,
        v: [(usize1, usize1); n - 1]
    }
    let d = tree_diameter(&v);
    println!("{}", if d % 3 == 1 {"Second"} else {"First"});
}

fn tree_diameter(es: &Vec<(usize, usize)>) -> usize {
    let n = es.len() + 1;
    let mut t: Vec<BTreeSet<usize>> = vec![BTreeSet::new(); n];
    for (a, b) in es.iter().cloned() {
        t[a].insert(b);
        t[b].insert(a);
    }
    let mut tab: BTreeMap<(usize, usize), usize> = BTreeMap::new();
    let mut tab2: Vec<[usize; 2]> = vec![[0, 0]; n];
    let _ = dfs(0, 0, &t, &mut tab, &mut tab2);
    for &c in t[0].iter() {
        dfs2(c, 0, &t, &tab, &mut tab2);
    }
    tab2.iter().map(|x| x[0]).max().unwrap()
}

fn dfs(r: usize, p: usize, t: &Vec<BTreeSet<usize>>, tab: &mut BTreeMap<(usize, usize), usize>, tab2: &mut Vec<[usize; 2]>) -> usize {
    let mut d = 1;
    for &c in t[r].iter() {
        if c == p {
            continue;
        }
        let dist = dfs(c, r, t, tab, tab2);
        if dist > tab2[r][0] {
            tab2[r][1] = tab2[r][0];
            tab2[r][0] = dist;
        } else if dist > tab2[r][1] {
            tab2[r][1] = dist;
        }
        d = max(d, dist + 1);
    }
    tab.insert((p, r), d);
    d
}

fn dfs2(r: usize, p: usize, t: &Vec<BTreeSet<usize>>, tab: &BTreeMap<(usize, usize), usize>, tab2: &mut Vec<[usize; 2]>) {
    let d = if tab2[p][0] == *tab.get(&(p, r)).unwrap() {
        tab2[p][1] + 1
    } else {
        tab2[p][0] + 1
    };
    if d > tab2[r][0] {
        tab2[r][1] = tab2[r][0];
        tab2[r][0] = d;
    } else if d > tab2[r][1] {
        tab2[r][1] = d;
    }
    for &c in t[r].iter() {
        if c == p {
            continue;
        }
        dfs2(c, r, t, tab, tab2);
    }
}