def pow_m(n, p, m):
    r = n
    ret = 1
    while p > 0:
        if p % 2 == 0:
            r = r * r % m
            p /= 2
        else:
            ret = ret * r % m
            p -= 1
    return ret


m = int(input())
print(pow_m(2, 128, m))