#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <unordered_map>
using namespace std;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template<class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
  return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template<class T, class V>
typename enable_if<is_class<T>::value == 0>::type fill(T &t, const V &v) {
    t = v;
}
template<class T, class V>
typename enable_if<is_class<T>::value != 0>::type fill(T &t, const V &v){
    for (auto &e : t) fill(e, v);
}

#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P)
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, vector<vector<T> > P)
{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }

#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
template<class T> ostream& operator << (ostream &s, set<T> P)
{ EACH(it, P) { s << "<" << *it << "> "; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s << endl; }


vector<int> Prev;
pair<int,int> DiameterDFS(const vector<vector<int> > &G, int v, int p) {
    pair<int,int> res(v, 0);
    for (int i = 0; i < (int)G[v].size(); ++i) {
        if (G[v][i] == p) continue;
        pair<int,int> tmp = DiameterDFS(G, G[v][i], v);
        tmp.second++;
        if (tmp.second > res.second) {
            res = tmp;
            Prev[G[v][i]] = v;
        }
    }
    return res;
}

vector<int> Diameter(const vector<vector<int> > &G) {
    Prev = vector<int>((int)G.size(), -1);
    pair<int,int> leaf = DiameterDFS(G, 0, -1);
    Prev = vector<int>((int)G.size(), -1);
    pair<int,int> t = DiameterDFS(G, leaf.first, -1);
    vector<int> res;
    int cur = t.first;
    while (cur != -1) {
        res.push_back(cur);
        cur = Prev[cur];
    }
    return res;
}



using Graph = vector<vector<int> >;
int N;
Graph G;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    while (cin >> N) {
        G.assign(N, vector<int>());
        for (int i = 0; i < N-1; ++i) {
            int a, b; cin >> a >> b; --a, --b;
            G[a].push_back(b);
            G[b].push_back(a);
        }
        auto di = Diameter(G);

        int V = di.size();
        if (V % 3 == 2) cout << "Second" << endl;
        else cout << "First" << endl;
    }
}


















Measured memory_bytes: 29424