#include "bits/stdc++.h"

using namespace std;
using ll = long long int;
using pii = pair<int, int>;
using pil = pair<int, ll>;

// Graph.h start--------------------------------------------
using Weight = int;

struct Vertex;
using Vertices = std::vector<Vertex *>;
struct Edge;
using Edges = std::vector<const Edge *>;

struct Vertex {
	const int id;
	Edges edges;
	Vertex(int id);
	void add_edge(const Edge *const p_e);
	void add_edge(const Edges &es);
};

struct Edge {
	Vertex *p_src, *p_dst;
	Weight weight;

	Edge(Vertex *p_src, Vertex *p_dst, Weight weight);
	Edge(const Edge &e);
	Edge& operator = (const Edge &de);
};

struct Graph {
	Vertices vertices;
	Edges edges;
	Graph(int nvertices);
	~Graph();
	void add_edge(Edge *p_edge);
	void add_edge(int edge_src, int edge_dst, Weight w);
};

//----------------------------------------------------------

using namespace std;

Vertex::Vertex(int id) : id(id) { }
void Vertex::add_edge(const Edge *const p_e) {
	edges.push_back(p_e);
}
void Vertex::add_edge(const Edges &es) {
	for (const auto &p_e : es) {
		add_edge(p_e);
	}
}

Edge::Edge(Vertex *p_src, Vertex *p_dst, Weight weight) : p_src(p_src), p_dst(p_dst), weight(weight) { }
Edge::Edge(const Edge &e) : Edge(e.p_src, e.p_dst, e.weight) {}
Edge& Edge::operator = (const Edge &e) {
	p_src = e.p_src;
	p_dst = e.p_dst;
	weight = e.weight;
	return *this;
}
bool operator < (const Edge &e1, const Edge &e2) {
	return e1.weight != e2.weight ? e1.weight > e2.weight : // !!INVERSE!!
	e1.p_src != e2.p_src ? e1.p_src->id < e2.p_src->id : e1.p_dst->id < e2.p_dst->id;
}

Graph::Graph(int nvertices) {
	for (int id = 0; id < nvertices; id++) {
		vertices.push_back(new Vertex(id));
	}
}
Graph::~Graph() {
	for (auto &p_vertex : vertices) {
		delete p_vertex;
	}
	for (auto &p_edge : edges) {
		delete p_edge;
	}
}
void Graph::add_edge(Edge *p_edge) {
	vertices[p_edge->p_src->id]->add_edge(p_edge);
	edges.push_back(p_edge);
}
void Graph::add_edge(int edge_src, int edge_dst, Weight w) {
	add_edge(new Edge(vertices[edge_src], vertices[edge_dst], w));
}

// Graph.h end----------------------------------------------

// Diameter.h start----------------------------------------

using Result = pair<Weight, int>;

Result visit(int p, int v, const Graph &g);
Weight diameter(const Graph &g);

//----------------------------------------------------------
Result visit(int id_pv, int id_tv, const Graph &g) {
	Result r(0, id_tv);
	for (const auto &e : g.vertices[id_tv]->edges)
		if (e->p_dst->id != id_pv) {
			Result t = visit(id_tv, e->p_dst->id, g);
			t.first += e->weight;
			if (r.first < t.first) r = t;
		}
	return r;
}
Weight diameter(const Graph &g) {
	Result r = visit(-1, 0, g);
	Result t = visit(-1, r.second, g);
	return t.first; // (r.second, t.second) is farthest pair
}

// Diameter.h end------------------------------------------

int main() {
	int N;
	cin >> N;
	vector<int> a(N - 1);
	vector<int> b(N - 1);
	for (int i = 0; i < N - 1; i++)
	{
		cin >> a[i] >> b[i];
		a[i]--;
		b[i]--;
	}

	Graph g(N);
	for (int i = 0; i < N - 1; i++)
	{
		g.add_edge(a[i], b[i], 1);
		g.add_edge(b[i], a[i], 1);
	}
	Weight max_L = diameter(g);

	if (max_L % 3 != 1) {
		cout << "First" << endl;
	}
	else {
		cout << "Second" << endl;
	}

	return 0;
}


Measured memory_bytes: 50284