ans = set() 
  
  
 def get(n, k): 
     lst = [] 
     while n > 0: 
         lst.append(n % k) 
         n = n // k 
  
     return ''.join(reversed([str(x) for x in lst])) 
  
  
 def moves(h): 
     return get(int(str(h), 3) + int('1', 3), 3), (get(int(str(h), 3) + int(str(h), 3) + int('1', 3), 3)) 
  
  
 def f(h, m=0): 
     if m == 11: 
         if h in ans: 
             return 0 
         ans.add(h) 
         return 1 
  
     return sum(f(x, m=m + 1) for x in moves(h)) 
  
  
 print(f(get(3, 3))) 
 

 allResults = set() 
 def rec( n, remains ): 
  if remains == 0: 
    allResults.add( n ) 
    return 
  rec( n+1, remains-1 ) 
  rec( n*2+1, remains-1 ) 
  
 rec( 3, 11 ) 
 print( len(allResults) )