output_description: Print attributes of each item in order. Print an item in a line and adjacency
  attributes should be separated by a single space.
input_description: The input is given in the following format.
  
      
      
      $n$
      $v_0 \; w_0 \; t_0 \; d_0 \; s_0$
      $v_1 \; w_1 \; t_1 \; d_1 \; s_1$
      :
      $v_{n-1} \; w_{n-1} \; t_{n-1} \; d_{n-1} \; s_{n-1}$
      
  
  In the first line, the number of items $n$. In the following $n$ lines,
  attributes of each item are given. $v_i \; w_i \; t_i \; d_i \; s_i$ represent
  value, weight, type, date and name of the $i$-th item respectively.
attempt: if __name__ == "__main__":
      n = int(input())
      items = []  # type: ignore
  
      for _ in range(n):
          v, w, t, d, s = input().split()
          v, w, d = map(lambda x: int(x), [v, w, d])  # type: ignore
          items.append((v, w, t, d, s))
  
      items = sorted(items, key=lambda x: (x[0], x[1], x[2], x[3], x[4]))
  
      for elem in items:
          print(f"{elem[0]} {elem[1]} {elem[2]} {elem[3]} {elem[4]}")
  
problem_description: Sorting Tuples
  
  Write a program which reads $n$ items and sorts them. Each item has attributes
  $\\{value, weight, type, date, name\\}$ and they are represented by $\\{$
  integer, integer, upper-case letter, integer, string $\\}$ respectively. Sort
  the items based on the following priorities.
  
    1. first by value (ascending)
    2. in case of a tie, by weight (ascending)
    3. in case of a tie, by type (ascending in lexicographic order)
    4. in case of a tie, by date (ascending)
    5. in case of a tie, by name (ascending in lexicographic order)
samples: [{"input": "5\n    105 24 C 1500000000000 white\n    100 23 C 1500000000000 blue\n    105 23 A 1480000000000 pink\n    110 25 B 1500000000000 black\n    110 20 A 1300000000000 gree", "output": "100 23 C 1500000000000 blue\n    105 23 A 1480000000000 pink\n    105 24 C 1500000000000 white\n    110 20 A 1300000000000 gree\n    110 25 B 1500000000000 black"}]