output_description: Print `First` if Takahashi will win, and print `Second` if Aoki will win.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      a_1 b_1
      a_2 b_2
      :
      a_{N-1} b_{N-1}
attempt: N = int(input())
  if N == 1:
      print("First")
      exit()
  ab = [list(map(int, input().split())) for _ in range(N - 1)]
  
  R = {}
  for a, b in ab:
      if a - 1 in R:
          R[a - 1].append(b - 1)
      else:
          R[a - 1] = [b - 1]
      if b - 1 in R:
          R[b - 1].append(a - 1)
      else:
          R[b - 1] = [a - 1]
  
  L = [0] * N
  L[0] = 1
  F = []
  RL = {}
  RL[1] = [0]
  RL[2] = []
  for i in R[0]:
      F.append(i)
      L[i] = 2
      RL[2].append(i)
  
  k = 2
  while F != []:
      k += 1
      Ft = []
      RL[k] = []
      for i in F:
          for j in R[i]:
              if L[j] == 0:
                  L[j] = k
                  Ft.append(j)
                  RL[k].append(j)
      F = Ft
  
  d = 0
  D = [0] * N
  for i in range(k - 1, 0, -1):
      for j in RL[i]:
          for k in R[j]:
              if L[k] == i - 1:
                  if D[k] == 0:
                      D[k] = D[j] + 1
                      d = max(d, D[j] + 1)
                  else:
                      d = max(d, D[j] + D[k] + 1)
                      D[k] = max(D[k], D[j] + 1)
  
  if d % 3 == 1:
      print("Second")
  else:
      print("First")
  
problem_description: Statement
  
  Takahashi and Aoki will play a game on a tree. The tree has N vertices
  numbered 1 to N, and the i-th of the N-1 edges connects Vertex a_i and Vertex
  b_i.
  
  At the beginning of the game, each vertex contains a coin. Starting from
  Takahashi, he and Aoki will alternately perform the following operation:
  
    * Choose a vertex v that contains one or more coins, and remove all the coins from v.
    * Then, move each coin remaining on the tree to the vertex that is nearest to v among the adjacent vertices of the coin's current vertex.
  
  The player who becomes unable to play, loses the game. That is, the player who
  takes his turn when there is no coin remaining on the tree, loses the game.
  Determine the winner of the game when both players play optimally.
samples: [{"input": "3\n    1 2\n    2 3", "output": "First\n    \n\nHere is one possible progress of the game:\n\n  * Takahashi removes the coin from Vertex 1. Now, Vertex 1 and Vertex 2 contain one coin each.\n  * Aoki removes the coin from Vertex 2. Now, Vertex 2 contains one coin.\n  * Takahashi removes the coin from Vertex 2. Now, there is no coin remaining on the tree.\n  * Aoki takes his turn when there is no coin on the tree and loses.\n\n* * *"}, {"input": "6\n    1 2\n    2 3\n    2 4\n    4 6\n    5 6", "output": "Second\n    \n\n* * *"}, {"input": "7\n    1 7\n    7 4\n    3 4\n    7 5\n    6 3\n    2 1", "output": "First"}]