#include <bits/stdc++.h>
#define int long long
#define lint long long
#define pii pair<int,int>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(c) (c).begin(),(c).end()
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
#define MINF(a) memset(a,0x3f,sizeof(a))
#define POW(n) (1LL<<(n))
#define IN(i,a,b) (a <= i && i <= b)
using namespace std;
template <typename T> inline bool CHMIN(T& a,T b) { if(a>b) { a=b; return 1; } return 0; }
template <typename T> inline bool CHMAX(T& a,T b) { if(a<b) { a=b; return 1; } return 0; }
template <typename T> inline void SORT(T& a) { sort(ALL(a)); }
template <typename T> inline void REV(T& a) { reverse(ALL(a)); }
template <typename T> inline void UNI(T& a) { sort(ALL(a)); a.erase(unique(ALL(a)),a.end()); }
template <typename T> inline T LB(vector<T>& v, T a) { return *lower_bound(ALL(v),a); }
template <typename T> inline int LBP(vector<T>& v, T a) { return lower_bound(ALL(v),a) - v.begin(); }
template <typename T> inline T UB(vector<T>& v, T a) { return *upper_bound(ALL(v),a); }
template <typename T> inline int UBP(vector<T>& v, T a) { return upper_bound(ALL(v),a) - v.begin(); }
template <typename T1, typename T2> ostream& operator<< (ostream& os, const pair<T1,T2>& p) { os << p.first << " " << p.second; return os; }
template <typename T1, typename T2> istream& operator>> (istream& is, pair<T1,T2>& p) { is >> p.first >> p.second; return is; }
template <typename T> ostream& operator<< (ostream& os, const vector<T>& v) { REP(i,v.size()) { if (i) os << " "; os << v[i]; } return os; }
template <typename T> istream& operator>> (istream& is, vector<T>& v) { for(T& in : v) is >> in; return is; }
template <typename T = int> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...)); }
template <typename T, typename V> typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) { t = v; }
template <typename T, typename V> typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) { for(auto &e : t) fill_v(e,v); }
const lint MOD = 1000000007;
const lint INF = 0x3f3f3f3f3f3f3f3f;
const double EPS = 1e-10;

template<typename T, int SIZE>
struct Diameter {
    struct edge {
        int to; T cost;
        edge(int to, T cost) : to(to), cost(cost) {}
    };

    vector<edge> g[SIZE];
    int pre[SIZE], dis[SIZE], __diameter;
    vector<int> __path;

    int diameter() {
        return __diameter;
    }

    vector<int> path() {
        return __path;
    }

    void add_edge(int from,int to,T cost) {
        g[from].emplace_back(to,cost);
        g[to].emplace_back(from,cost);
    }

    void build() {
        memset(dis, -1, sizeof(dis));
        memset(pre, -1, sizeof(pre));
        dfs(0, 0, 0);
        int bp = 0, ep = 0;
        for (int i = 0; i < SIZE; i++) if (pre[i] >= 0) {
            if (dis[i] > dis[ep]) {
                ep = i;
            }
        }
        memset(dis, -1, sizeof(dis));
        memset(pre, -1, sizeof(pre));
        dfs(ep, ep, 0);
        for (int i = 0; i < SIZE; i++) if (pre[i] >= 0) {
            if (dis[i] > dis[bp]) {
                bp = i;
            }
        }
        __diameter = dis[bp];
        __path.clear();
        int p = bp;
        while (p != ep) {
            __path.push_back(p);
            p = pre[p];
        }
        __path.push_back(p);
    }

    void dfs(int v,int pv,int d) {
        pre[v] = pv; dis[v] = d;
        for (edge e : g[v]) if (e.to != pv) {
            dfs(e.to,v,d+e.cost);
        }
    }
};

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);

    int N;
    cin >> N;
    Diameter<int, 200010> D;
    REP(i, N-1) {
        int a, b;
        cin >> a >> b;
        a--; b--;
        D.add_edge(a, b, 1);
    }
    D.build();
    cout << (D.diameter() % 3 != 1 ? "First" : "Second") << endl;

    return 0;
}

Measured memory_bytes: 26868