---

def conv_to_base(n, t):
    digits = "0123456789ABCDEF"
    result = []

    while n:
        result.append(digits[n % t])
        n //= t

    return ''.join(result[::-1])


def replace_last_with_first(n):
    s = str(n)
    if len(s) == 1:
        return n
    result_str = s[0] + s[1:-1] + s[0]
    return result_str

def duplicate_last_digit(number):
    last_digit = number[-1]
    result_str = number[:-1] + last_digit * 2
    return result_str

minN = 9999999
for n in range(3, 200):
    bin_n = conv_to_base(n, 3)
    R = 0

    if n % 5 != 0:
        R = int(str(replace_last_with_first(bin_n)) + conv_to_base(n % 5, 3), 3)
    else:
        R = int(duplicate_last_digit(bin_n), 3)
    if R > 123 and minN < R:
        minN = R

print(minN)