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())

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

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

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

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

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

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

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

Solution (Python):
import sys
import math
from collections import defaultdict
from bisect import bisect_left, bisect_right

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def LI(): return list(map(int, input().split()))
def LIR(row,col):
    if row <= 0:
        return [[] for _ in range(col)]
    elif col == 1:
        return [I() for _ in range(row)]
    else:
        read_all = [LI() for _ in range(row)]
        return map(list, zip(*read_all))



x = I()

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

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

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

Solution (Python):
print('1' if input()=='0' else '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)
elif x == 1:
  print(0)

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

Solution (Python):
def main():
    ans = 1 if input() == "0" else 0
    print(ans)


main()

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

if a%2 ==0:
    print("1")
else:
    print("0")

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

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

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

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

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

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

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

Solution (Python):
x = input()

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

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

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):
def main():
    x = int(input())
    if x == 0:
        print(1)
    else:
        print(0)


if __name__ == "__main__":
    main()

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

if a == 1 :
    print(0)

if a == 0:
    print(1)

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

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

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

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

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

Solution (Python):
def func(x):
  if x == 0:
    return 1
  else:
    return 0

if __name__ == "__main__":
    x = int(input())
    print(func(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):
import sys
import math
from collections import defaultdict, deque, Counter
from copy import deepcopy
from bisect import bisect, bisect_right, bisect_left
from heapq import heapify, heappop, heappush
    
input = sys.stdin.readline
def RD(): return input().rstrip()
def F(): return float(input().rstrip())
def I(): return int(input().rstrip())
def MI(): return map(int, input().split())
def MF(): return map(float,input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def LF(): return list(map(float,input().split()))
def Init(H, W, num): return [[num for i in range(W)] for j in range(H)]
    
    
def main():
    temp = I()
    if temp == 0:
        print(1)
    else:
        print(0)
if __name__ == "__main__":
    main()

Solution (Python):
def main():
    print(int(not int(input())))

if __name__ == "__main__":
    main()

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

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

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

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

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

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

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

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

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

Solution (Python):
a=int(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)
elif x == 0:
  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)
elif x == 1:
    print(0)

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
if (int(input())) == 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):
x = int(input())
if x == 0:
    print(1)
else:
    print(0)

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

if_1_0(x)

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

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

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(1 if x == 0 else 0)

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

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

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

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

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

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

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

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

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

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

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= input()
if x == '1':
  print('0')
else:
  print('1')

Solution (Python):
x=int(input())
if(x==1):
  print(0)
elif(x==0):
  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):
input = int(input())
if input == 1:
	print(0)
if input == 0:
  	print(1)

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

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

Solution (Python):


import sys
from typing import Any, Callable, Deque, Dict, List, Mapping, Optional, Sequence, Set, Tuple, TypeVar, Union































def main():
    Num = Union[int, float]
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input():  return sys.stdin.readline().rstrip()
    def ii():     return int(input())
    def isp():    return input().split()
    def mi():     return map(int, input().split())
    def mi_0():   return map(lambda x: int(x)-1, input().split())
    def lmi():    return list(map(int, input().split()))
    def lmi_0():  return list(map(lambda x: int(x)-1, input().split()))
    def li():     return list(input())
    def debug(x): print(x, file=sys.stderr)
    
    
    
    x = ii()
    print(1 if x == 0 else 0)


if __name__ == "__main__":
    main()

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

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

Solution (Python):
x = input()
x = int(x)
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 = 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 = input()

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

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

Solution (Python):
import sys,bisect,string,math,time,functools,random,fractions
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
rep=range;R=range
def Golf():n,*t=map(int,open(0).read().split())
def I():return int(input())
def S_():return input()
def IS():return input().split()
def LS():return [i for i in input().split()]
def MI():return map(int,input().split())
def LI():return [int(i) for i in input().split()]
def LI_():return [int(i)-1 for i in input().split()]
def NI(n):return [int(input()) for i in range(n)]
def NI_(n):return [int(input())-1 for i in range(n)]
def NLI(n):return [[int(i) for i in input().split()] for i in range(n)]
def NLI_(n):return [[int(i)-1 for i in input().split()] for i in range(n)]
def StoLI():return [ord(i)-97 for i in input()]
def ItoS(n):return chr(n+97)
def LtoS(ls):return ''.join([chr(i+97) for i in ls])
def RA():return map(int,open(0).read().split())
def RLI(n=8,a=1,b=10):return [random.randint(a,b)for i in range(n)]
def RI(a=1,b=10):return random.randint(a,b)
def INP():
    N=10;A=10
    n=random.randint(1,N)
    a=[random.randint(1,A) for i in range(n)]
    return n,a
def Rtest(T):
    case,err=0,0
    for i in range(T):
        inp=INP()
        a1=naive(*inp)
        a2=solve(*inp)
        if a1!=a2:
            print((a1,a2),inp)
            err+=1
        case+=1
    print('Tested',case,'case with',err,'errors')
def GI(V,E,ls=None,Directed=False,index=1):
    org_inp=[];g=[[] for i in range(V)]
    FromStdin=True if ls==None else False
    for i in range(E):
        if FromStdin:
            inp=LI()
            org_inp.append(inp)
        else:
            inp=ls[i]
        if len(inp)==2:
            a,b=inp;c=1
        else:
            a,b,c=inp
        if index==1:a-=1;b-=1
        aa=(a,c);bb=(b,c);g[a].append(bb)
        if not Directed:g[b].append(aa)
    return g,org_inp
def GGI(h,w,search=None,replacement_of_found='.',mp_def={'
    
    mp=[boundary]*(w+2);found={}
    for i in R(h):
        s=input()
        for char in search:
            if char in s:
                found[char]=((i+1)*(w+2)+s.index(char)+1)
                mp_def[char]=mp_def[replacement_of_found]
        mp+=[boundary]+[mp_def[j] for j in s]+[boundary]
    mp+=[boundary]*(w+2)
    return h+2,w+2,mp,found
def TI(n):return GI(n,n-1)
def accum(ls):
    rt=[0]
    for i in ls:rt+=[rt[-1]+i]
    return rt
def bit_combination(n,base=2):
    rt=[]
    for tb in R(base**n):s=[tb//(base**bt)%base for bt in R(n)];rt+=[s]
    return rt
def gcd(x,y):
    if y==0:return x
    if x%y==0:return y
    while x%y!=0:x,y=y,x%y
    return y
def YN(x):print(['NO','YES'][x])
def Yn(x):print(['No','Yes'][x])
def show(*inp,end='\n'):
    if show_flg:print(*inp,end=end)

mo=10**9+7

inf=float('inf')
FourNb=[(-1,0),(1,0),(0,1),(0,-1)];EightNb=[(-1,0),(1,0),(0,1),(0,-1),(1,1),(-1,-1),(1,-1),(-1,1)];compas=dict(zip('WENS',FourNb));cursol=dict(zip('LRUD',FourNb))
l_alp=string.ascii_lowercase

read=sys.stdin.buffer.read;readline=sys.stdin.buffer.readline;input=lambda:sys.stdin.readline().rstrip()


class Comb:
    def __init__(self,n,mo=10**9+7):
        self.fac=[0]*(n+1)
        self.inv=[1]*(n+1)
        self.fac[0]=1
        self.fact(n)
        for i in range(1,n+1):
            self.fac[i]=i*self.fac[i-1]%mo
            self.inv[n]*=i
            self.inv[n]%=mo
        self.inv[n]=pow(self.inv[n],mo-2,mo)
        for i in range(1,n):
            self.inv[n-i]=self.inv[n-i+1]*(n-i+1)%mo
        return
    
    def fact(self,n):
        return self.fac[n]
        
    def invf(self,n):
        return self.inv[n]

    def comb(self,x,y):
        if y<0 or y>x:
            return 0
        return self.fac[x]*self.inv[x-y]*self.inv[y]%mo

show_flg=False
show_flg=True



n=I()

print(1-n)

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

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

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

print(int(not x))

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

Solution (Python):
import sys, re
import math
import numpy as np
from decimal import Decimal
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul	
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd	
from heapq import heappush, heappop
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.maxsize = 10 ** 15
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7
 

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

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

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

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

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

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

Solution (Python):
print(0 if int(open(0).read()) == 1 else 1)

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

Solution (Python):
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")


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

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

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

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

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

Solution (Python):
if int(input()) is 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):
print(1) if int(input()) == 0 else print(0)

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

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

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

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

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

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

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

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

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

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 == 0:
    print('1')
else:
    print('0')

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

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

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

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

Solution (Python):


import math

import itertools
from collections import deque
from collections import Counter
import heapq


import bisect
a=int(input())
if a==0:
    print(1)
else:
    print(0)

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

print(1-x)

Solution (Python):
import sys, bisect, math, itertools, string, queue, copy
import numpy as np
import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush

sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplt(n): return [tuple(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

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

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

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

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

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

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

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

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

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

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

Solution (Python):
a = int(input())
if a == 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 == 0:
  print(1)
if x == 1:
  print(0)

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

Solution (Python):
x = input()

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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:
  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 == 0:
    print(1)
else:
    print(0)

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

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

if a&1:
    print(0)

else:
    print(1)

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

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

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

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

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

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

Solution (Python):
import math

judge = int(input())
if judge == 0:
    print("1")
elif judge == 1:
    print("0")
else:
    print("入力エラーです。")

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

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

if (x < 1):
    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 == 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)
if x==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):
print(int(not int(input())))

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

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

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

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

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


if x == 0:
    print(1)
if x == 1:
    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):
x=int(input())
if x<1:
  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:
    n=0
else:
    n=1
print(n)

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

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

Solution (Python):


x = int(input())

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

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

Solution (Python):



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


if __name__ == '__main__':
    main()

Solution (Python):
n=int(input())
if n==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:
    x = 1
else:
    x = 0

print(x)

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

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):
def not_func(x):
  if x == 1:
    return 0
  elif x == 0:
    return 1

x = int(input())
print(not_func(x))

Solution (Python):
import numpy as np 

x=int(input(""))

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

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

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

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

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

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

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

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")
elif x==0:
  print("1")

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

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

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

    print('1')


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)
elif (x == 1):
    print(0)

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

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

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


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

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

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

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

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

resolve()

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

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

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

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

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

Solution (Python):
def solve():

    x = int(input())

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

if __name__ == "__main__":
    solve()

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

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

Solution (Python):
if not int(input()):
  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)
elif n == 1:
    print (0)

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):
import sys
from heapq import heappush, heappop, heapify
import math
from math import gcd
import itertools as it
from collections import deque 

input = sys.stdin.readline

def inp():
    return int(input())
def inpl():
    return list(map(int, input().split()))
def dbg(o):
    print(o, file=sys.stderr)



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

Solution (Python):
n=int(input())
if n==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())
if x==0:
  print("1")
else:
  print("0")

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

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

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

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

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


if __name__ == "__main__":
    main()

Solution (Python):
import sys
from collections import deque
from functools import lru_cache
import bisect
import copy
import heapq
import itertools
import math
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
mod = 10 ** 9 + 7

def read_values(): return map(int, input().split())
def read_index(): return map(lambda x: int(x) - 1, input().split())
def read_list(): return list(read_values())
def read_lists(N): return [read_list() for n in range(N)]


class Comb:
    def __init__(self, N):
        F = [1] * (N + 1)
        for i in range(N):
            F[i + 1] = (i + 1) * F[i] % mod

        self.d_inv = {}
        self.d_comb = {}
        self.F = F

    def inv(self, a):
        if a not in self.d_inv:
            self.d_inv[a] = pow(a, mod - 2, mod)
        return self.d_inv[a]

    def comb(self, a, b):
        if (a, b) not in self.d_comb:
            self.d_comb[(a, b)] = (self.F[a] * self.inv(self.F[a - b]) * self.inv(self.F[b])) % mod
            self.d_comb[(a, a - b)] = self.d_comb[(a, b)]
        return self.d_comb[(a, b)] 



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

if __name__ == "__main__":
    main()

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

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

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

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

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

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

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

Solution (Python):
n=int(input())
print('01'[n!=1])

Solution (Python):

import sys


def main():
    x = int( sys.stdin.readline() )

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


if __name__ == "__main__":
    main()

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

Solution (Python):
x = input()

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

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

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

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

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

Solution (Python):
""" A
"""
import sys
import math
from functools import reduce
from bisect import bisect_left

def readString():
    return sys.stdin.readline()

def readInteger():
    return int(readString())

def readStringSet(n):
    return sys.stdin.readline().split(" ")[:n]

def readIntegerSet(n):
    return list(map(int, readStringSet(n)))

def readIntegerMatrix(n, m):
    return [lambda _: readIntegerSet(m) for _ in range(0, n)]

def main(x):
    return 0 if x == 1 else 1

if __name__ == "__main__":
    _x = readInteger()

    print(main(_x))

Solution (Python):



x = int(input())


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

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

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

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

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

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

Solution (Python):
if int(input()) == 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")
elif x == 1 :
  print("0")

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

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

if input_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())
print(1) if x == 0 else print(0)

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

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

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

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

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

Solution (Python):
x = 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):
bin = [1,0]
print(bin[int(input())])

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

Solution (Python):
in_n = input().split()
n = int(in_n[0])
if n == 1:
    print(0)
elif n == 0:
    print(1)

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

if(num == 1): 
  print('0')
elif(num == 0):
  print('1')

Solution (Python):

N = input()

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

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

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