def n2p(n, p):
    s = ''
    while n > 0:
        dig = n % p
        s = str(dig) + s
        n //= p
    return s

def alg(n):
    n3 = n2p(n, 3)
    if n % 3 == 0:
        n3 = n3 + n3[-2:]
    else:
        sm = sum(int(d, 3) for d in n3)
        n3 = n3 + n2p(3*sm, 3)
    r = int(n3, 3)
    return r

# min нечетное R > 208
t = []
for n in range(1, 100):
    r = alg(n)
    if r > 208 and r % 2 != 0:
        t += [r]

print(min(t)) # 243