Problem:
 Score : 100 points    Problem Statement Given is an integer x that is greater than or equal to 0 , and less than or equal to 1 .
Output 1 if x is equal to 0 , or 0 if x is equal to 1 .      Constraints  0 \leq x \leq 1  x is an integer         Input Input is given from Standard Input in the following format:  x       Output Print 1 if x is equal to 0 , or 0 if x is equal to 1 .        Sample Input 1 1      Sample Output 1 0       Sample Input 2 0      Sample Output 2 1

Solution (Python):
x = int(input())

print((x+1) % 2)

Solution (Python):

x = int(input())
if x == 1:
    print(0)
else:
    print(1)

Solution (Python):
x=int(input())
print(x^1)

Solution (Python):
a = int(input())
if a ==1:
    print(0)
else:
    print(1)

Solution (Python):
n=int(input())
print(1 if n==0 else 0)

Solution (Python):
i=int(input())
if i==1:
  print(0)
else:
  print(1)

Solution (Python):
x = int(input())
print(x ^ 1)

Solution (Python):
x = int(input())
if x == 0:
    print(1)
else:
    print(0)

Solution (Python):
x = int(input())
if x==1:
    print("0")
else:
    print("1")

Solution (Python):
x = int(input())

if x == 0:
    print(1)
else:
    print(0)

Solution (Python):
x=int(input())
if x==0:
    print('1')
else:
    print('0')

Solution (Python):
n=int(input())

if n == 0:
    print(1)
else:
    print(0)

Solution (Python):
x = int(input())

if x == 0:
    print(1)
else:
    print(0)

Solution (Python):
i = int(input())

if i == 0:
    print(1)
else:
    print(0)

Solution (Python):
x = int(input())
if x == 0:
    print(1)
else:
    print(0)

Solution (Python):
x = int(input())

if x == 1:
  print(0)
else:
  print(1)

Solution (Python):
x = int(input())

if x:
    print(0)
else:
    print(1)

Solution (Python):
x = int(input())
print(1 if x == 0 else 0)

Solution (Python):
import sys
import math
import collections
import bisect
import itertools
import decimal
import copy
import heapq




INF = 10 ** 20
MOD = 10 ** 9 + 7


ni = lambda: int(sys.stdin.readline().rstrip())
ns = lambda: map(int, sys.stdin.readline().rstrip().split())
na = lambda: list(map(int, sys.stdin.readline().rstrip().split()))
na1 = lambda: list(map(lambda x: int(x) - 1, sys.stdin.readline().rstrip().split()))
flush = lambda: sys.stdout.flush()



def main():
    x=ni()
    print(1 if x==0 else 0)





if __name__ == '__main__':
    main()

Solution (Python):
x = int(input())
if x == 0:
    print(1)
else:
    print(0)

Solution (Python):
def resolve():
    
    
    
    
    x=int(input())
    if x==0:
      print(1)
    else:
      print(0
      )

if __name__ == '__main__':
    resolve()

Solution (Python):
x = int(input())
if x==0:
  print(1)
else:
  print(0)

Solution (Python):
a = int(input())
if a == 1:
  print(0)
else:
  print(1)

Solution (Python):
def resolve():
    x = int(input())
    if x == 1:
        print(0)
    else:
        print(1)
resolve()

Solution (Python):
x = int(input())

if x == 0:
    print(1)
elif x == 1:
    print(0)

Solution (Python):

import sys
import math
import decimal
import itertools
from itertools import product
from functools import reduce
def input():
    return sys.stdin.readline()[:-1]
def gcd(*numbers):
    return reduce(math.gcd, numbers)
def lcm_base(x, y):
    return (x * y) // math.gcd(x, y)
def lcm(*numbers):
    return reduce(lcm_base, numbers, 1)
def sort_zip(a:list, b:list):
    z = zip(a, b)
    z = sorted(z)
    a, b = zip(*z)
    a = list(a)
    b = list(b)
    return a, b
def ceil(x):
    return math.ceil(x)
def floor(x):
    return math.floor(x)

def main():
    x = int(input())

    if x == 0:
        print(1)
    else:
        print(0)




if __name__ == '__main__':
    main()

Solution (Python):
x=int(input())
if x == 0:
  print(1)
else:
  print(0)

Solution (Python):
x = int(input())
if x == 0:
    print(1)
else:
    print(0)

Solution (Python):
n=int(input())
print(1-n)

Solution (Python):
n = int(input())
if n == 1:
    print(0)
else:
    print(1)

Solution (Python):
x=int(input())
if x==1:
  print(0)
else:
  print(1)

Solution (Python):
n = int(input())
print(1 if n is 0 else 0)

Solution (Python):
A=int(input())
if A==1:
  print(0)
else:
  print(1)

Solution (Python):
x = int(input())
if x == 1:
    print(0)
else:
    print(1)

Solution (Python):
x = int(input())
print(int(1-x))

Solution (Python):
X=int(input())
if X==0:
  print(1)
else:
  print(0)

Solution (Python):
N = int(input())
if N==1:
  print(0)
else:
  print(1)

Solution (Python):
a = input()
print(int(not int(a)))

Solution (Python):
x = input()
d = {"1": "0", "0": "1"}
print(d[x])

Solution (Python):
x = int(input())
a = [1,0]
print(a[x])

Solution (Python):
x = int(input())
if x == 0:
    print(1)
else:
    print(0)

Solution (Python):
x=input()

if(x=="0"):
  print(1)
else:
  print(0)

Solution (Python):
x = int(input())
if x==1:
    print(0)
else:
    print(1)

Solution (Python):

def main():
    x = int(input())
    if x == 0:
        print(1)
    else:
        print(0)

if __name__ == '__main__':
    main()

Solution (Python):
x=int(input())
if x==1:
    print(0)
else:
    print(1)

Solution (Python):
n = int(input())

if n == 0:
    print(1)
elif n == 1:
    print(0)

Solution (Python):
a = int(input())
if a == 0:
    print(1)
else:
    print(0)

Solution (Python):
print(1 - int(input()))

Solution (Python):
x = int(input())

print(1 if x == 0 else 0)

Solution (Python):
x = int(input())
print(1) if x == 0 else print(0)

Solution (Python):
s = int(input())
if s == 0:
    print('1')
elif s == 1:
    print('0')

Solution (Python):
print((int(input())+1)%2)

Solution (Python):
x=int(input())
if x == 0:
    print(1)
else:
    print(0)

Solution (Python):
x=int(input())
if x==1:
    print(0)
else:
    print(1)

Solution (Python):
x = int(input())

if x == 0:
  print(1)
else:
  print(0)

Solution (Python):
x = int(input())
if x == 1:
    print(0)
else:
    print(1)

Solution (Python):
if int(input()) == 1:
    print(0)
else:
    print(1)

Solution (Python):

x = int(input())
if x==0:
    print(1)
else:
    print(0)

Solution (Python):
num = int(input())
if num == 1:
    print(0)
elif num == 0:
    print(1)

Solution (Python):
x = int(input())

if x == 1:
    print(0)
else:
    print(1)

Solution (Python):
x=int(input())

print(1 if x==0 else 0)

Solution (Python):
x=int(input())
if x==0:
    print(1)
else:
    print(0)

Solution (Python):
if __name__ == '__main__':
    x = input()
    print('0' if x == '1' else '1')

Solution (Python):
x = int(input())
if (x==0):
    print(1)
else:
    print(0)

Solution (Python):
x = int(input())
if x == 0:
    print(1)
else:
    print(0)

Solution (Python):


from queue import Queue
from queue import LifoQueue as Stack
from math import sqrt, floor, ceil, log2, log10, pi
from fractions import gcd
from itertools import permutations, combinations
from operator import itemgetter
from functools import cmp_to_key
from bisect import bisect_left


INF=1001001001
__MOD__=(10**9)+7
yn = 'YNeos'
judge = False
cnt = 0
ans = None


def lcm(a, b):
    return (a*b) // gcd(a,b)

def intinput():
    return int(input())

def mulinputs():
    return map(int,input().split())

def lineinputs(func=intinput):
    datas = []
    while True:
        try:
            datas.append(func())
        except EOFError:
            break
    return datas

def bindex(a,x):
    i = bisect_left(a,x)
    if i != len(a) and a[i] == x:
        return i
    return None

class ModInt():
    def __init__(self, x):
        self.__x = (x % __MOD__)
    def __add__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((self.__x + other.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((self.__x + other.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")
    def __radd__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((other.__x + self.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((other.__x + self.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")

    def __sub__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((self.__x - other.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((self.__x - other.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")
    def __rsub__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((other.__x - self.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((other.__x - self.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")

    def __mul__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((self.__x * other.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((self.__x * other.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")
    def __rmul__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((other.__x * self.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((other.__x * self.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")

    def __truediv__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((self.__x * other.__modinv())%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((self.__x * other.__modinv())%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")
    def __rtruediv__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((other.__x * self.__modinv())%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((other.__x * self.__modinv())%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")

    def __pow__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__(pow(self.__x, other.__x, __MOD__)))
        elif type(other) == ModInt:
            return self.__class__(pow(self.__x, other.__x, __MOD__))
        else:
            raise Exception("Not Int or Not ModInt")
    def __rpow__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__(pow(other.__x, self.__x, __MOD__)))
        elif type(other) == ModInt:
            return self.__class__(pow(other.__x, self.__x, __MOD__))
        else:
            raise Exception("Not Int or Not ModInt")

    def __modinv(self, m=__MOD__):
        a = self.__x
        if a == 0:
            raise ZeroDivisionError()
        if gcd(a, m) != 1:
            raise Exception("%sの逆数は求まりません。" % a)
        b, u, v = m, 1, 0
        while b != 0:
            t = a//b;
            a -= t*b
            a, b = b, a
            u -= t * v
            u, v = v, u
        u %= m
        if u < 0:
            u += m
        return u
    def __int__(self):
        return self.__x
    def __str__(self):
        return str(self.__x)



if __name__ == '__main__':
    N = intinput()

    
    print((not N)+0)

Solution (Python):
n = int(input())
if n == 1:
  print(0)
else:
  print(1)

Solution (Python):
x=int(input())
if x==0:
    print(1)
else:
    print(0)

Solution (Python):
def main():
    x = int(input())
    if x == 1:
        print(0)
    else:
        print(1)
    
if __name__ == '__main__':
    main()

Solution (Python):
if __name__ == '__main__':

	n = int(input())
	if n == 0:
		print(1)
	else:
		print(0)

Solution (Python):
x = int(input())
if x: print(0)
else: print(1)

Solution (Python):
s = int(input())
if s == 1:
    print(0)
else:
    print(1)

Solution (Python):
n=int(input())
if n==1:
  print(0)
else:
  print(1)

Solution (Python):
X=int(input())
print([1,0][X])

Solution (Python):

printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split())
ins = lambda : input().strip()
DBG = True 
BIG = 10**18
R = 10**9 + 7


def ddprint(x):
  if DBG:
    print(x)

x = inn()
print(1-x)

Solution (Python):
x = int(input())

if x==1:
  print(0)
else:
  print(1)

Solution (Python):
x = int(input())

print(1-x)

Solution (Python):
x=int(input())
if x==0:
    print(1)
else:
    print(0)

Solution (Python):
n = int(input())

if n == 0:
    print(1)
else:
    print(0)

Solution (Python):


def solve():
    return str(1-int(input()))

if __name__ == '__main__':
    print(solve())

Solution (Python):
x = int(input())

if x == 0:
    print(1)
else :
    print(0)

Solution (Python):
a = int(input())
print("1" if(a == 0) else "0")

Solution (Python):
x = int(input())
if x == 0:
    print(1)
elif x == 1:
    print(0)

Solution (Python):
n = int(input())
if n:
  print(0)
else:
  print(1)

Solution (Python):
a=int(input())
if a==1 :
  print('0')
else :
  print('1')

Solution (Python):
a=int(input())
if a:
  print(0)
else:
  print(1)

Solution (Python):
import bisect, copy, heapq, math, sys
from collections import *
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product
def input():
    return sys.stdin.readline()[:-1]
def ruiseki(lst):
    return [0]+list(accumulate(lst))
def celi(a,b):
    return -(-a//b)
sys.setrecursionlimit(5000000)
mod=pow(10,9)+7
al=[chr(ord('a') + i) for i in range(26)]
direction=[[1,0],[0,1],[-1,0],[0,-1]]

x=int(input())
print(1-x)

Solution (Python):
def main():
    x = int(input())

    if x == 0:
        print(1)
    elif x == 1:
        print(0)


if __name__ == "__main__":
    main()

Solution (Python):
N = int(input())
print(1 if not N else 0)

Solution (Python):
x = int(input())
if x == 0:
    print(1)
else:
    print(0)

Solution (Python):
import sys
input = sys.stdin.readline


def read():
    x = int(input().strip())
    return x,


def solve(x):
    return 1 - x


if __name__ == '__main__':
    inputs = read()
    outputs = solve(*inputs)
    if outputs is not None:
        print("%s" % str(outputs))

Solution (Python):
x = int(input())
if x == 1:
  print(0)
else:
  print(1)

Solution (Python):
from sys import stdin

def main():

    input = stdin.readline

    x= int(input())

    if x == 1:
        print("0")
    else:
        print("1")


if __name__ == "__main__":
    main()

Solution (Python):
a=int(input())

if a==0:
  print("1")
elif a==1:
  print("0")

Solution (Python):
if int(input()) == 0:
    print(1)
else:
    print(0)

Solution (Python):
import sys,queue,math,copy,itertools,bisect,collections,heapq

def main():
    sys.setrecursionlimit(10**7)
    INF = 10**18
    MOD = 10**9 + 7
    LI = lambda : [int(x) for x in sys.stdin.readline().split()]
    _LI = lambda : [int(x)-1 for x in sys.stdin.readline().split()]
    NI = lambda : int(sys.stdin.readline())
    SI = lambda : sys.stdin.readline().rstrip()
    DD = ((1,0),(0,1),(-1,0),(0,-1))

    x = NI()
    print(1-x)

if __name__ == '__main__':
    main()

Solution (Python):



N = int(input())
res = (N+1) % 2
print(res)

Solution (Python):
N = int(input())
if N == 1:
    print(0)
else:
    print(1)

Solution (Python):
x=int(input())

if x==0:
    print(1)
if x==1:
    print(0)

Solution (Python):
x = int(input())
print(0 if x else 1)

Solution (Python):
N = int(input())

if N == 1:
    print(0)
else:
    print(1)

Solution (Python):
x = int(input())

if x == 0:
  print('1')

else:
  print('0')

Solution (Python):
x = int(input())

if x == 0:
    print(1)
else:
    print(0)

Solution (Python):
x = int(input())
if x == 1:
  print(0)
else:
  print(1)

Solution (Python):
x = int(input())
if x == 0:
    print(1)
elif x == 1:
    print(0)

Solution (Python):
x = int(input())

if x==1:
    print(0)
else:
    print(1)

Solution (Python):
a=input()
if a == "1":
  print("0")
else:
  print("1")

Solution (Python):
x = int(input())
if x == 0:
  print(1)
else:
  print(0)

Solution (Python):
x = int(input())

if x==1:
    print(0)
else:
    print(1)

Solution (Python):
x = int(input())
print(int(not x))

Solution (Python):
x = int(input())

if x == 0:
    print(1)
else:
    print(0)

Solution (Python):
x = int(input())
if x:
    print(0)
else:
    print(1)

Solution (Python):
x = int(input())
if x == 0:
    print(1)
else:
    print(0)

Solution (Python):
import sys
import math

x = int(input())

if x == 0:
    print(1)
else:
    print(0)

Solution (Python):

import sys


def solve(x: int):
    return 1 if x == 0 else 0



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    x = int(next(tokens))  
    print(solve(x))

def test():
    import doctest
    doctest.testmod()

if __name__ == '__main__':
    
    main()

Solution (Python):
x=int(input())
if x==0:
    print(1)
else:
    print(0)

Solution (Python):
x=int(input())
if x==1:
    print(0)
else:
    print(1)

Solution (Python):
N = int(input())

if N == 0:
    print(1)
else:
    print(0)

Solution (Python):
def main():
    x = int(input())
    if x == 0:
        return 1
    else:
        return 0

print(main())

Solution (Python):
x = int(input())
if x ==1:
    print(0)
else:
    print(1)

Solution (Python):
print(1 - int(input()))

Solution (Python):
print([1,0][input()=='1'])

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**6)
    x = int(input())
    print(x ^ 1)

if __name__ == '__main__':
    main()

Solution (Python):
print(1-int(input()))

Solution (Python):
a = int(input())
if a == 0:
    print(1)
elif a == 1:
    print(0)

Solution (Python):
x = int(input())
if x == 0:
    print(1)
else:
    print(0)

Solution (Python):
x = int(input())
if x == 1:
  print(0)
else:
  print(1)

Solution (Python):
N = int(input())
if N == 1:
    print(0)
else:
    print(1)

Solution (Python):

import sys,io,os,time
from collections import defaultdict
from collections import Counter
from collections import deque
from itertools import combinations
from itertools import permutations
import bisect,math,heapq
alphabet = "abcdefghijklmnopqrstuvwxyz"

input = sys.stdin.readline



x = int(input())
if x == 1:
	print(0)
else:
	print(1)








'''


import collections,sys,threading
sys.setrecursionlimit(10**9)
threading.stack_size(10**8)



threading.Thread(target=solve).start()
'''

Solution (Python):
A = int(input())
print(0 if A == 1 else 1)

Solution (Python):
x = int(input())
if x == 0:
  print(1)
else:
  print(0)

Solution (Python):
x=int(input())
if x==0:
    print(1)
elif x==1:
    print(0)

Solution (Python):
x = int(input())

if x == 0:
    print(1)
else:
    print(0)

Solution (Python):
x=int(input())
print(1 if x==0 else 0)

Solution (Python):
x = int(input())

if x == 0:
    print(1)
else:
    print(0)

Solution (Python):
n = int(input())
print(1 if n == 0 else 0)

Solution (Python):
x = int(input())

if x == 0:
    print(1)
else:
    print(0)

Solution (Python):
import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush,heapify
from math import ceil, floor, sqrt
from copy import deepcopy

def main():
    x = int(input())

    if (x == 1):
        print(0)
    else:
        print(1)

if __name__ == "__main__":
    main()

Solution (Python):
x = int(input())
if x:
    print("0")
else:
    print("1")

Solution (Python):
x = int(input())
if x == 0:
    print(1)
else:
    print(0)

Solution (Python):
x = int(input())

if x == 0:
    print(1)
else:
    print(0)

Solution (Python):
def resolve():
    x = int(input())
    if x == 0:
        print(1)
    else:
        print(0)
resolve()

Solution (Python):
x = int(input())
if x == 1:
    print(0)
else:
    print(1)

Solution (Python):
x = input()
print(1 - int(x))

Solution (Python):
n = int(input())
if n == 1:
    print(0)
else:
    print(1)

Solution (Python):
x=int(input())
if x==1:
    print(0)
else:
    print(1)

Solution (Python):


x = int(input())
print(1 - x)

Solution (Python):
x = int(input())
if x == 1:
    print(0)
else:
    print(1)

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline

n = int(input())
if n==1:
    print(0)
elif n==0:
    print(1)

Solution (Python):
x = int(input())

if x == 0:
    print(1)
if x == 1:
    print(0)

Solution (Python):
x = int(input())
print(1-x)

Solution (Python):
x = int(input())
if x == 0:
    print(1)
else:
    print(0)

Solution (Python):
def main():
    a = int(input())
    if a==0:
        print(1)
    else:
        print(0)

if __name__ == "__main__":
    main()

Solution (Python):
x = int(input())
if x == 0:
    print(1)
else:
    print(0)

Solution (Python):
x=int(input())
if x==1:
    print(0)
else:
    print(1)

Solution (Python):
a=int(input())
print(1-a)

Solution (Python):
x = int(input())
if x == 1:
    print(0)
else:
    print(1)

Solution (Python):
n = int(input())
if n == 0:
    print(1)
else:
    print(0)

Solution (Python):

x = int(input())

if x == 0:
    print(1)
else:
    print(0)

Solution (Python):
n = int(input())

if n == 0:
    print(1)
else:
    print(0)

Solution (Python):
x = int(input())
if x == 0:
    print('1')
else:
    print('0')

Solution (Python):

import sys
from collections import deque, Counter
from heapq import heappop, heappush
from bisect import bisect_right
from itertools import accumulate

sys.setrecursionlimit(10**6)
INF = 10**12
m = 10**9 + 7


def main():
    N = int(input())
    print(int(N == 0))


if __name__ == "__main__":
    main()

Solution (Python):
s=int(input())
if s==1:
	print(0)
else:
	print(1)

Solution (Python):
x = int(input())
if x==0:
    print(1)
else:
    print(0)

Solution (Python):
x=int(input())
print(0 if x==1 else 1)

Solution (Python):
X = int(input())
print(1-X)

Solution (Python):

N = int(input())
if N==0:
    print(1)
else:
    print(0)

Solution (Python):
import sys

def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list(map(lambda x: x-1, MII()))

def main():
    x = II()
    if x == 0:
        print(1)
    else:
        print(0)

if __name__ == '__main__':
    main()

Solution (Python):
def getN():
    return int(input())
def getNM():
    return map(int, input().split())
def getList():
    return list(map(int, input().split()))
def getArray(intn):
    return [int(input()) for i in range(intn)]
def input():
    return sys.stdin.readline().rstrip()
def rand_N(ran1, ran2):
    return random.randint(ran1, ran2)
def rand_List(ran1, ran2, rantime):
    return [random.randint(ran1, ran2) for i in range(rantime)]
def rand_ints_nodup(ran1, ran2, rantime):
  ns = []
  while len(ns) < rantime:
    n = random.randint(ran1, ran2)
    if not n in ns:
      ns.append(n)
  return sorted(ns)

def rand_query(ran1, ran2, rantime):
  r_query = []
  while len(r_query) < rantime:
    n_q = rand_ints_nodup(ran1, ran2, 2)
    if not n_q in r_query:
      r_query.append(n_q)
  return sorted(r_query)

from collections import defaultdict, deque, Counter
from sys import exit
from decimal import *
from heapq import heapify, heappop, heappush
import math
import random
import string
from copy import deepcopy
from itertools import combinations, permutations, product
from operator import mul, itemgetter
from functools import reduce
from bisect import bisect_left, bisect_right

import sys
sys.setrecursionlimit(1000000000)
mod = 10 ** 9 + 7





X = getN()
if X == 0:
    print(1)
else:
    print(0)

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

x = int(input())
ans = 0 if x==1 else 1
print(ans)

Solution (Python):
import sys
input = lambda : sys.stdin.readline().rstrip()

x = int(input())
outs = [0, 1]
outs.remove(x)
print(outs[0])

Solution (Python):
from sys  import stdin,stdout

st=lambda:list(stdin.readline().strip())
li=lambda:list(map(int,stdin.readline().split()))
mp=lambda:map(int,stdin.readline().split())
inp=lambda:int(stdin.readline())
pr=lambda n: stdout.write(str(n)+"\n")

mod=1000000007

def solve():
    n=inp()
    print((n+1)%2)
    


for _ in range(1):
    solve()

Solution (Python):
x=int(input())
if x==0:
    print(1)
else:
    print(0)

Solution (Python):
N = int(input())

if N == 0:
    print(1)
else:
    print(0)

Solution (Python):
x = int(input())

if x == 0:
    print(1)

else :
    print(0)

Solution (Python):
print(1 if int(input()) == 0 else 0)

Solution (Python):
import sys
import math


sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))

x = ini()

if x == 0:
    print(1)
else:
    print(0)

Solution (Python):
x = int(input())
print(1-x)

Solution (Python):
def main():
    n = int(input())
    if n == 1:
        return 0
    else:
        return 1

if __name__ == '__main__':
    print(main())

Solution (Python):
a=int(input())
if a==1:
  print(0)
else:
  print(1)

Solution (Python):
print(1 if input() == '0' else 0)

Solution (Python):
print(int(input())^1)

Solution (Python):
n = int(input())
print(1 - n)

Solution (Python):
x = input()

if (x == "0"):
    print(1)
else:
    print(0)

Solution (Python):
print(0 if input() == '1' else 1)

Solution (Python):
x = int(input())
if x == 0:
    print(1)
else:
    print(0)

Solution (Python):
x = int(input())
if x==0:
  print('1')
else:
  print('0')

Solution (Python):
x=int(input())

if x==1:
    print(0)
else:
    print(1)

Solution (Python):
x = int(input())

if x == 1:
  print(0)
else:
  print(1)

Solution (Python):
x = int(input())
if x==1:
    print(0)
else:
    print(1)

Solution (Python):
x = int(input())

if x == 0:
    print(1)
else:
    print(0)

Solution (Python):
n=int(input())
if (n==1):
    print(0)
else:
    print(1)

Solution (Python):
print(0 if int(input())==1 else 1)

Solution (Python):
x = int(input())
if x == 0:
    print(1)
else:
    print(0)

Solution (Python):
n=int(input())
if n==0:
    print('1')
else:
    print('0')

Solution (Python):
x = int(input())

print('0' if x == 1 else '1')

Solution (Python):
print(0 if int(input()) == 1 else 1)

Solution (Python):
x = int(input())
print(0 if x else 1)

Solution (Python):
s=input()

if s=='0':
  print(1)
else:
  print(0)

Solution (Python):
n=int(input())
if n==1:
  print(0)
else:
  print(1)

Solution (Python):
x=int(input())
if x == 0:
  print(1)
else:
  print(0)

Solution (Python):
a = int(input())
if a:
    print(0)
else:
    print(1)

Solution (Python):
def main():
    x = int(input())
    print(abs(1-x))


if __name__ == '__main__':
    main()

Solution (Python):
import math
from math import gcd,pi,sqrt
INF = float("inf")

import sys
sys.setrecursionlimit(10**6)
import itertools
from collections import Counter,deque
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]


def main():
    x = i_input()
    if x == 1:
        print(0)
    else:
        print(1)


if __name__=="__main__":
    main()

Solution (Python):




def input_int():
    return int(input())



def int1(x):
    return int(x) - 1



def input_to_int_map():
    return map(int, input().split())



def input_to_int_tuple():
    return tuple(map(int, input().split()))



def input_to_int_tuple_minus1():
    return tuple(map(int1, input().split()))


def main():
    x = int(input())

    if x >= 1:
        return 0
    return 1


if __name__ == "__main__":
    print(main())

Solution (Python):




import sys









MOD = 10 ** 9 + 7
INF = 10 ** 9
PI = 3.14159265358979323846

def read_str():      return sys.stdin.readline().strip()
def read_int():      return int(sys.stdin.readline().strip())
def read_ints():     return map(int, sys.stdin.readline().strip().split())
def read_ints2(x):   return map(lambda num: int(num) - x, sys.stdin.readline().strip().split())
def read_str_list(): return list(sys.stdin.readline().strip().split())
def read_int_list(): return list(map(int, sys.stdin.readline().strip().split()))
def GCD(a: int, b: int) -> int: return b if a%b==0 else GCD(b, a%b)
def LCM(a: int, b: int) -> int: return (a * b) // GCD(a, b)

def Main():
    x = read_int()
    if x == 0:
        print(1)
    else:
        print(0)

if __name__ == '__main__':
    Main()

Solution (Python):
x = int(input())
if x == 1:
    print(0)
else:
    print(1)

Solution (Python):
x = int(input())
if(x == 0):
    print(1)
else:
    print(0)

Solution (Python):
N = int(input())
print((N+1)%2)

Solution (Python):
x = int(input())

if x == 0:
    print(1)
else:
    print(0)

Solution (Python):

MOD = 10 ** 9 + 7
INFI = 10**10

import math
from collections import deque
import itertools
import heapq

from fractions import Fraction
import copy
from functools import lru_cache
from collections import defaultdict
import pprint




def sosuhante(n):
    for k in range(2, int(math.sqrt(n))+1):
        if n% k ==0:
            return False
    return True
def cmb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    for p in range(2,r+1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p-1,r,p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result

def kingaku(a,b,n):
    keta=len(str(n))
    return a*n+b*keta

def my_index(l, x, default=False):
    if x in l:
        return l.index(x)
    else:
        return default




def ret(a):
    c=[None]*(len(a)-1)
    if len(a)==1:
        return a[0]
    elif len(a)==0:
        return 0
    for i in range(1,len(a)):
        c[i-1]=abs(a[i]-a[i-1])
    return ret(c)

def soinsubunkai(n):
    a = []
    i = 1
    while i*i <= n:
        if n % i == 0 and i!=1:
            a.append(i)
            n=n//i

        if n% i !=0 or i==1:
            i += 1
    nokori=[n]
    return a + nokori

def soinsubunkai_e(n,m): 
    a = set()
    i = 1
    while n>1:
        a.add(m[n])
        n=n//m[n]
    nokori=n
    a.add(nokori)
    return a

def make_divisors(n):
    lower_divisors , upper_divisors = [], []
    i = 1
    while i*i <= n:
        if n % i == 0:
            lower_divisors.append(i)
            if i != n // i:
                upper_divisors.append(n//i)
        i += 1
    return lower_divisors + upper_divisors[::-1]


def era(n): 
    b=[i for i in range(n+1)]
    for i in range(2,int(math.sqrt(n)+10)):
        j=1
        temp=i*j
        while temp<=n:
            b[temp]=min(i,b[temp])
            temp+=i
    return b


def main():
    
    n=int(input())
    print(-(n-1))









if __name__ == "__main__":

    main()