def pow_r(x, n, mod):
    ans = 1
    while (n > 0):
        if (bin(n & 1) == bin(1)):
            ans = ans * x
        ans = ans % mod
        x = x * x
        x = x % mod
        n = n >> 1  # ビットシフト
    return ans



if __name__ == '__main__':
    M = int(input())
    print(pow_r(2,128, M))