#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <functional>
#include <array>
#include <map>
#include <queue>
#include <time.h>
#include <limits.h>
#include <set>
#include <stack>
#include <random>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#define rep(i,s,n) for(int i = (s); (n) > i; i++)
#define REP(i,n) rep(i,0,n)
#define RANGE(x,a,b) (min(a,b) <= (x) && (x) <= max(a,b)) //hei
#define DUPLE(a,b,c,d) (RANGE(a,c,d) || RANGE(b,c,d) || RANGE(c,a,b) || RANGE(d,a,b))
#define INCLU(a,b,c,d) (RANGE(a,c,d) && (b,c,d))
#define PW(x) ((x)*(x))
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define MODU 998244353LL
#define bitcheck(a,b)   ((a >> b) & 1)
#define bitset(a,b)      ( a |= (1 << b))
#define bitunset(a,b)    (a &= ~(1 << b))
#define MP(a,b) make_pair((a),(b))
#define Manh(a,b) (abs((a).first-(b).first) + abs((a).second - ((b).second))
#define pritnf printf
#define scnaf scanf
#define itn int
#define PI 3.141592653589


#define izryt bool
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template<typename A, size_t N, typename T>
void Fill(A(&array)[N], const T &val) {
	std::fill((T*)array, (T*)(array + N), val);
}
pll Dir[4] = {
	{ -1 ,0 },{ 0 , 1 },{ 1 ,0 },{ 0 ,-1 }
};

//[a, b)
#define Getsum(ar, a,b) (ar[b] - ar[a])
#define INF 10000000000000000LL
#define chmax(a,b) a = max(a,b)
#define chmin(a,b) a = min(a,b)

struct Edge {
int from, to;
ll w;
bool operator<(const Edge& rhs) const {
	return MP(w, MP(from, to)) < MP(rhs.w, MP(rhs.from, rhs.to));
}
};
ll mod_pow(ll x, ll n, ll mod) {
	ll res = 1;
	while (n > 0) {
		if (n & 1) res = res * x %mod;
		x = x * x%mod;
		n >>= 1;
	}
	return res;
}
typedef vector<vector<Edge>> Graph;


bool solve(int r, int sp, vector<pii> c) {
	sp--;
	pii inter = { 0, r - 1 };

	REP(i, c.size()) {
		if (c[i].first == 0) {
			inter.first = max(inter.first, inter.first - c[i].second);
			inter.second = min(inter.second, inter.second - c[i].second);
		}
		else {
			inter = MP(min(inter.first, inter.first - c[i].second), max(inter.second, inter.second - c[i].second));
		}

		if (inter.second < inter.first) {
			return 1;
		}
		inter.first = max(0, inter.first);
		inter.second = min(r - 1, inter.second);
	}

	if (inter.first <= sp && inter.second >= sp) {
		return 0;
	}
	else
	{
		return 1;
	}
}

pii dist(Graph& g, int src) {

	queue<pii> buf;
	vector<int> dist(g.size(), -1);

	pii ret = {};
	buf.push({ 0, src });
	while (buf.size()) {
		pii cur = buf.front();
		buf.pop();

		if (dist[cur.second] != -1) {
			continue;
		}

		dist[cur.second] = cur.first;
		chmax(ret, cur);

		for (auto itr : g[cur.second]) {
			if (dist[itr.to] != -1) continue;
			buf.push({ cur.first + 1, itr.to });
		}
	}

	return ret;
}

signed main(void) {

	int n;

	cin >> n;
	Graph g(n);

	int dp[200100] = {};

	dp[1] = 1;

	REP(i, n - 1) {
		int a, b;
		cin >> a >> b;
		a--, b--;
		g[a].push_back({ a,b });
		g[b].push_back({ b,a });
	}

	rep(i, 2, n + 1) {
		if (dp[i - 1] != dp[i - 2]) {
			dp[i] = 0;
		}
		if (dp[i - 1] == 0 && dp[i - 2] == 0) {
			dp[i] = 1;
		}
		if (dp[i - 1] == 1 && dp[i - 2] == 1){
			return -1;
		}
	}

	pii st = dist(g, 0);
	pii en = dist(g, st.second);

	int d = en.first;

	if (dp[d] == 0) {
		cout << "First" << endl;
	}
	else
	{
		cout << "Second" << endl;
	}

	return 0;
}


Measured memory_bytes: 17516