from sympy import factorint, divisors, gcd
from sympy.ntheory.factor_ import digits
from operator import mul

def a000265(n): return max(list(filter(lambda i: i%2 == 1, divisors(n))))

def a030101(n): return int(bin(n)[2:][::-1], 2)

def a030102(n): return 0 if n==0 else int(''.join(map(str, digits(n, 3)[1:][::-1])), 3)

def a038502(n):
    f=factorint(n)
    return 1 if n==1 else reduce(mul, [1 if i==3 else i**f[i] for i in f])

def a038500(n): return n/a038502(n)

def a263273(n): return 0 if n==0 else a030102(a038502(n))*a038500(n)

def a057889(n): return 0 if n==0 else a030101(a000265(n))*gcd(2**n, n)

def a(n): return a263273(a057889(n))