#include <bits/stdc++.h>
#ifdef LOCAL_DEBUG
#define DEBUG 1
#define CERR if(DEBUG) cerr
#define MACRO(_1,_2,_3,_4,_5,_6,_7,_8,_9,_10,NAME,...) NAME
#define pr(...) CERR<<MACRO(__VA_ARGS__,pr10,pr9,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)<<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#define pr3(a,b,c) pr1(a)<<pr2(b,c)
#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)
#define pr5(a,b,c,d,e) pr1(a)<<pr4(b,c,d,e)
#define pr6(a,b,c,d,e,f) pr1(a)<<pr5(b,c,d,e,f)
#define pr7(a,b,c,d,e,f,g) pr1(a)<<pr6(b,c,d,e,f,g)
#define pr8(a,b,c,d,e,f,g,h) pr1(a)<<pr7(b,c,d,e,f,g,h)
#define pr9(a,b,c,d,e,f,g,h,i) pr1(a)<<pr8(b,c,d,e,f,g,h,i)
#define pr10(a,b,c,d,e,f,g,h,i,j) pr1(a)<<pr9(b,c,d,e,f,g,h,i,j)
#define prArr(a){CERR<<(#a)<<"={";int i=0;for(auto t:(a))CERR<<(i++?", ":"")<<t;CERR<<"}"<<endl;}
#else
#define DEBUG 0
#define pr(...)
#define prArr(a)
#endif
using namespace std;
using Int = long long;
using _int = int;
using ll = long long;
using Double = long double;
const Int INF = (1LL<<60)+1e9; // ~ 1.15 * 1e18
const Int mod = (1e9)+7;
const Double EPS = 1e-8;
const Double PI = 6.0 * asin((Double)0.5);
using P = pair<Int,Int>;
template<class T> T Max(T &a,T b){return a=max(a,b);}
template<class T> T Min(T &a,T b){return a=min(a,b);}
template<class T1, class T2> ostream& operator<<(ostream& o,pair<T1,T2> p){return o<<"("<<p.first<<","<<p.second<<")";}
template<class T1, class T2, class T3> ostream& operator<<(ostream& o,tuple<T1,T2,T3> t){return o<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class T1, class T2> istream& operator>>(istream& i,pair<T1,T2> &p){return i>>p.first>>p.second;}
template<class T> ostream& operator<<(ostream& o,vector<T> a){Int i=0;for(T t:a)o<<(i++?" ":"")<<t;return o;}
template<class T> istream& operator>>(istream& i,vector<T> &a){for(T &t:a)i>>t;return i;}
//INSERT ABOVE HERE

class DiameterOfTree{
public:
  typedef pair<Int,Int> P;
  Int V;
  vector<vector<P> > G; //(to, cost)
  vector<Int> nodeCost; //ノードに重みがある場合
  Int start, end, length;
  Int ok;
  DiameterOfTree():V(-1){}
  DiameterOfTree(Int V):V(V),G(V),nodeCost(V, 0),ok(false){};

  void add_edge(Int a,Int b,Int c = 1){
    ok = false;
    assert(a < V && b < V);
    assert(a >= 0 && b >= 0);
    G[a].push_back( P(b, c) );
    G[b].push_back( P(a, c) );
  }

  //O(V + E);
  void build(Int start=0){
    ok = true;
    assert(start < V);
    dfs(start);
    dfs(end);
  }

  void dfs(Int pos,Int pre = -1,Int len = 0){
    if(pre == -1) start = pos, length = -1;
    len += nodeCost[pos];
    if(len > length) length = len, end = pos;
    for(P p:G[pos]) if(p.first != pre) dfs(p.first, pos, len+p.second);
  }

  //s-t間のパスを取得 : O(V + E)
  vector<Int> getPath(Int s,Int t){
    assert(0 <= s && s < V);
    assert(0 <= t && t < V);

    vector<Int> res;
    function<Int(Int,Int)> dfs = [&](Int pos,Int pre){
      if(pos == s) {res.push_back(pos); return 1;}
      for(P p:G[pos]){
        Int to = p.first;
        if(to != pre && dfs(to, pos)){res.push_back(pos); return 1;}
      }
      return 0;
    };

    dfs(t, -1); //{s, . . .,t}の順で入っている
    assert(res[0] == s && res.back() == t);
    return res;
  }
};

signed main(){
  srand((unsigned)time(NULL));
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(12);

  Int N;
  cin>>N;
  DiameterOfTree T(N);
  for(Int i=0;i<N - 1;i++){
    Int a, b;
    cin>>a>>b; a--, b--;
    T.add_edge(a, b);
  }

  T.build();
  Int len = T.length;

  Int x = len % 3;
  if(x == 1) cout<<"Second"<<endl;
  else cout<<"First"<<endl;

  return 0;
}


Measured memory_bytes: 22784