while max < x:
    min = max + 1
    if level % 2 == 1: # odd
    n *= 2
    max += n
    else: # even
    n *= 3
    max += n
    level += 1

pos = ceil( (x - min + 1) / pair )

a = f(n)
    b = f(a[0] - 1)
    parent = b[0] + a[3] - 1