# inset.py
# Fig. 14.2 
# input: 511, 994, 995, 996, 997, 998, 999
#         T    T    F    F    F    F   T

def inS(x):
  if x == 0:
    return True
  x -= 1   
  if (x % 2 != 0) and (x % 3 != 0):
    return False     # nothing divisible
  elif x % 3 != 0:   # one is dvisible
    return inS(x//2)    
  elif x % 2 != 0:   
    return inS(x//3) 
  else:              # both are divisible
    return inS(x//2) or inS(x//3)

n = int(input("n=? "))
print("in S:", inS(n))