#Consider an algorithm that takes as input a positive integer n. 
#If n is even, the algorithm divides it by two, and if n is odd, the algorithm multiplies it by three and adds one. 
#The algorithm repeats this, until n is one.

def num1(n):
  while n!=0:
    if n==1:
      break
    elif n%2==0:
      n= n/2
      print(n)
    elif n%2!=0:
      n = (n*3)+1
      print(n)
    

n = int(input("enter your integer"))
num1(n)
