Write a code to get 2 integers as input and find the HCF of the 2 integer without using recursion or Euclidean algorithm.

a,b=(int(no) for no in input().split())
while a%b!=0:
  rem=a%b
  a=b
  b=rem
print(b)