// Slower C++ solution:
//#pragma GCC target("avx2")

//#pragma GCC optimize("O3")

   

//#include <x86intrin.h>

#include <bits/stdc++.h>   

#include <ext/pb_ds/assoc_container.hpp>

#include <ext/pb_ds/tree_policy.hpp>

 

using namespace __gnu_pbds;

using namespace std;



template<typename T> using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

     

#define F first

#define S second           

#define lb lower_bound               

#define ub upper_bound

#define pb push_back

#define pf push_front    

#define ppb pop_back

#define mp make_pair

#define bpp __builtin_popcountll                                                                                        

#define sqr(x) ((x) * (x)) 

#define al 0x3F3F3F3F

#define sz(x) (int)x.size()

#define all(x) x.begin(), x.end()

#define in insert

#define ppf pop_front

#define endl '\n'

//#define int long long

 

typedef unsigned long long ull;

typedef long long ll;

typedef long double ld;

typedef pair <int, int> pii;

 

const int mod = (int)1e9 + 7;

const int N = (int)3e5 + 123;

const ll inf = (ll)1e18 + 1;



const double pi = acos (-1.0);

const double eps = 1e-7;                  

const int dx[] = {0, 0, 1, 0, -1};

const int dy[] = {0, 1, 0, -1, 0};



int n, r, st;

vector <int> g[N];



void dfs (int v, int pr = 0, int lvl = 0) {

   if (r < lvl) r = lvl, st = v;

   for (auto to : g[v])

      if (to != pr)

         dfs (to, v, lvl + 1);



}



inline void boost () {                    

   ios_base :: sync_with_stdio (NULL);

   cin.tie (NULL), cout.tie (NULL);          

}                                                     



inline void Solve () {

   cin >> n;

   for (int i = 1; i < n; i ++) {

      int x, y;

      cin >> x >> y;

      g[x].pb (y);

      g[y].pb (x);

   }

   dfs (1);

   r = 0;

   dfs (st);

   cout << (r % 3 == 1 ? "Second" : "First");

}



main () {                                       

// freopen (".in", "r", stdin);    

// freopen (".out", "w", stdout);              

   boost ();

   int tt = 1;

   //cin >> tt;   

   while (tt --) {

      Solve ();

   }                                               

   return 0;      

}

                          

// Faster C++ solution for the same problem (measured speedup: 1.3480772520393174x):
#include <bits/stdc++.h>

using namespace std;

using uint = unsigned int;

using ll = long long;

using ld = long double;

using ull = unsigned long long;

using pii = pair<int, int>;

using pll = pair<ll, ll>;

#define dbg(x) cerr<<#x": "<<(x)<<endl

#define dbg_p(x) cerr<<#x": "<<(x).first<<' '<<(x).second<<endl

#define dbg_v(x, n) {cerr<<#x"[]: ";for(long long _=0;_<n;++_)cerr<<(x)[_]<<' ';cerr<<endl;}

#define all(v) v.begin(), v.end()

#define fi first

#define se second



template<typename T1, typename T2>

ostream& operator <<(ostream &out, const pair<T1, T2> &item) {

	out << '(' << item.first << ", " << item.second << ')';

	return out;

}



template <typename T>

ostream& operator <<(ostream &out, const vector<T>& v) {

	for(const auto &item : v) out << item << ' ';

	return out;

}



const int N = 200010;



int node, dst;

bool win[N];

vector<int> adj[N];



void dfs(int v, int p = -1, int depth = 0) {

	if(depth >= dst) node = v, dst = depth;



	for(auto u : adj[v]) if(u != p) dfs(u, v, depth + 1);

}



int main()

{

	ios_base::sync_with_stdio(false);

	

	int n, a, b;



	win[0] = true;

	for(int i = 1; i < N; ++i) {

		if(!win[i - 1]) win[i] = true;

		else if(i > 1 && !win[i - 2]) win[i] = true;

		else win[i] = false;

	}



	cin >> n;

	for(int i = 1; i < n; ++i) {

		cin >> a >> b;

		adj[a].push_back(b);

		adj[b].push_back(a);

	}



	dfs(1);



	dst = 0;

	dfs(node);



	cout << (win[dst] ? "First" : "Second") << '\n';



	return 0;

}