output_description: Your program has to print the greatest common divisor for each pair of input
  numbers. Print each result on a new line.
input_description: The input file consists of several lines with pairs of two natural numbers in
  each line. The numbers do not exceed 100000.
  
  The number of pairs (datasets) is less than 50.
attempt: from math import gcd
  
  while True:
      try:
          a, b = map(int, input().split())
          print(gcd(a, b))
      except:
          break
  
problem_description: A: Greatest Common Divisor
  
  Please find the greatest common divisor of two natural numbers. A clue is: The
  Euclid's algorithm is a way to resolve this task.
samples: [{"input": "38\n    60 84", "output": "12"}]