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)

Solution (Python):
N, = map(int, input().split())
print(1-N)

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

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

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

Solution (Python):
def main():
    x = int(input())
    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):
print(int(input())^1)

Solution (Python):
print input()^1

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

Solution (Python):



"""






















using namespace std;

using int64 = long long;




int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);

  int x; cin >> x;
  cout << !x << endl;

  return 0;
}

"""

import base64
import subprocess
import zlib


exe_bin = "c%0=~eQaA-6~F

open("./kyomu", 'wb').write(zlib.decompress(base64.b85decode(exe_bin)))
subprocess.run(["chmod +x ./kyomu"], shell=True)
subprocess.run(["./kyomu"], shell=True)

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

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

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

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

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

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

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

Solution (Python):
import math as mt
import sys, string
from collections import Counter, defaultdict
input = sys.stdin.readline


I = lambda : int(input())
M = lambda : map(int, input().split())
ARR = lambda: list(map(int, input().split()))

n = I()
print(int(not n))

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

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

Solution (Python):


def main():
    print( int( input())^1)
if __name__ == '__main__':
    main()

Solution (Python):
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
import copy

if __name__ == "__main__":
    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())

print(1-x)

Solution (Python):
t=int(input(''))
print(1-t)

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

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

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

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

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

Solution (Python):
'''
Problem Link - https://atcoder.jp/contests/abc178/tasks/abc178_a
'''
from sys import stdin,stdout
from math import *
from collections import *

mod = 1000000007

def gcd(a,b):
	while b:
		a,b = b,a%b
	return a

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

def set_bits(X):
	c = 0
	while X:
		X &= (X-1);c += 1
	return c

def compute_MOD(N,M): return (N%M + M) % M

def get_array(): return list(map(int, stdin.readline().split()))
 
def get_ints(): return map(int, stdin.readline().split())

def get_int(): return int(stdin.readline())

def get_input(): return stdin.readline().strip()

def main():
	x = get_int()
	if x:stdout.write('0\n')
	else:stdout.write('1\n')

if __name__ == "__main__":
    main()

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

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

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

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

print(0 if n == 1 else 1)

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

Solution (Python):
import sys

input=sys.stdin.buffer.readline





def RD(): return sys.stdin.read()


def II(): return int(input())


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


def MF(): return map(float,input().split())


def LI(): return list(map(int,input().split()))


def LF(): return list(map(float,input().split()))


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





def main():
	print(1-II())
	

	

if __name__=="__main__":
	main()

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):
print(1 - int(input()))

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

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

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

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

Solution (Python):
import sys
INF = 1 << 60
MOD = 10**9 + 7 
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
def resolve():
    print(1 - int(input()))
resolve()

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

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

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

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

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

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

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

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

    print(0 if x else 1)


if __name__  == '__main__':
    main()

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

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

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


if __name__ == '__main__':
    resolve()

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

Solution (Python):
print(+(input()<'1'))

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

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

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

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

Solution (Python):
import sys
def I(): return int(sys.stdin.readline().rstrip())


print(1-I())

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

Solution (Python):

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

    print(1 if x == 0 else 0)


if __name__ == "__main__":
    resolve()

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

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

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

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

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

Solution (Python):
a = input()
if a == "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):
def main():
    t = int(input())

    if t == 0:
        print(1)
    else:
        print(0)
        
main()

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):
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):
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

x = ii()

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

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

Solution (Python):
print(int(bin(int(input()) ^ 1), 2))

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

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

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

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

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

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

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

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

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

Solution (Python):
print('10'[int(input())])

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

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

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

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

Solution (Python):

import numpy as np
from functools import *
import sys
sys.setrecursionlimit(100000)
input = sys.stdin.readline


def array(size, init=0):
    return [[init for j in range(size[1])] for i in range(size[0])]


def acinput():
    return list(map(int, input().split(" ")))


def II():
    return int(input())


x = II()

print((x+1) % 2)

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

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

Solution (Python):

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

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

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

Solution (Python):
import math

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


def b():
    pass



def c():
    pass



def d():
    pass


a()

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

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

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

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


if __name__ == '__main__':
    main()

Solution (Python):
x = 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 int_mtx(N):
    x = []
    for _ in range(N):
        x.append(list(map(int,input().split())))
    return np.array(x)

def str_mtx(N):
    x = []
    for _ in range(N):
        x.append(list(input()))
    return np.array(x)

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

def int_list():
    return list(map(int,input().split()))

def print_space(l):
    return print(" ".join([str(x) for x in l]))


import numpy as np
import collections as col

x = int(input())

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

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

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

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

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

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


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

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):
import os
import sys
from atexit import register
from io import BytesIO
sys.stdin = BytesIO(os.read(0, os.fstat(0).st_size))
sys.stdout = BytesIO()
register(lambda: os.write(1, sys.stdout.getvalue()))
input = lambda: sys.stdin.readline().rstrip('\r\n')
raw_input = lambda: sys.stdin.readline().rstrip('\r\n')

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

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

Solution (Python):
def f(x):
	if x == 0:
		return 1
	elif x == 1:
		return 0


n = float(input())
r = f(n)
if r != None:
	print(r)

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

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

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

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

print(abs(n-1))

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

print(x ^ 1)

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):


def f(x: int) -> int:
    """
    >>> f(0)
    1
    >>> f(1)
    0
    """
    if x == 1:
        return 0
    else:
        return 1


if __name__ == '__main__':
    x = int(input())
    print(f(x))

Solution (Python):

if __name__ == "__main__":
    x = int(input())
    ret = 0
    if x == 1:
        ret = 0
    else:
        ret = 1
    print(ret)

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

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

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

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

Solution (Python):
from sys import stdin,stdout

n = int(stdin.readline())
if n==0:
  stdout.write(str(1)+"\n")
else:
  stdout.write(str(0)+"\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 = bool(int(input()))
a = not x
print(int(a))

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

Solution (Python):

import sys

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

x = int(input())

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

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

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

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

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

Solution (Python):
if input()=="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):
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):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from math import gcd
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor, gcd
from operator import mul
from functools import reduce


sys.setrecursionlimit(2147483647)
INF = 10 ** 13
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().rstrip().split()
def S(): return sys.stdin.readline().rstrip()
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]

mod=10**9+7


x=I()
if x:
    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):
x=int(input()) 
if x>=0 and x<=1:
  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")
elif x == 1:
    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):
x = int(input())
print(x^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):
print(int(not int(input())))

Solution (Python):

 


x = int(input())

print((x + 1) % 2)

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

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

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

Solution (Python):

x = int(input())
print(int(not x))

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

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

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( 1 if int(input()) < 1 else 0)

Solution (Python):

from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def S(): return input().rstrip()
def LS(): return S().split()
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float("INF")


def solve():
    x = II()
    print(x^1)
    return



if __name__ == '__main__':
    solve()

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

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

if x == 1:
  r = 0
else:
  r = 1

print(r)

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

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

Solution (Python):
mod = 10**9 + 7
def C():
    N = int(input())
    ans = 10**N - 2*9**N + 8**N
    print(ans%mod)
def A():
    N = int(input())
    if( N == 0):
        print(1)
    else:
        print(0)
A()

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

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

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

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

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

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

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

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

print(x)

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

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

Solution (Python):
def resolve():
    N = input()

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

resolve()

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

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

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

Solution (Python):
x = int( input().strip() ) ; 

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

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

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

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

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

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

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

Solution (Python):
user = int(input())
if user >= 0 or user <= 1:
    if user == 1:
        print(0)
    elif(user==0):
        print(1)

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

Solution (Python):

import os
import sys
from io import BytesIO, IOBase

def ii():  return int(input())
def si():  return input()
def mi():  return map(int,input().strip().split(" "))
def li():  return list(mi())

def main():
    x = ii()

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




BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")



if __name__ == "__main__":
    main()

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

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

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

Solution (Python):

if __name__ == '__main__':
    x = [list(map(int, input().split())) for i in range(1)]

    try:
        x = int(x[0][0])
    except Exception as e:
        print('error')
        exit(1)

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

Solution (Python):
from __future__ import division, print_function
 
import os,sys
from io import BytesIO, IOBase
import math
 
if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from future_builtins import ascii, filter, hex, map, oct, zip
 
 
def ii():  return int(input())
def si():  return input()
def mi():  return map(int,input().strip().split(" "))
def msi(): return map(str,input().strip().split(" "))
def li():  return list(mi())
 
def dmain():
    sys.setrecursionlimit(1000000)
    threading.stack_size(1024000)
    thread = threading.Thread(target=main)
    thread.start()
    








 
abc='abcdefghijklmnopqrstuvwxyz'
abd={'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24, 'z': 25}
mod=1000000007

inf = float("inf")
vow=['a','e','i','o','u']
dx,dy=[-1,1,0,0],[0,0,1,-1]
def getKey(item): return item[1] 
def sort2(l):return sorted(l, key=getKey,reverse=True)
def d2(n,m,num):return [[num for x in range(m)] for y in range(n)]
def isPowerOfTwo (x): return (x and (not(x & (x - 1))) )
def decimalToBinary(n): return bin(n).replace("0b","")
def ntl(n):return [int(i) for i in str(n)]
def ncr(n,r): return factorial(n)//(factorial(r)*factorial(max(n-r,1)))
 
def ceil(x,y):
    if x%y==0:
        return x//y
    else:
        return x//y+1
 
def powerMod(x,y,p):
    res = 1
    x %= p
    while y > 0:
        if y&1:
            res = (res*x)%p
        y = y>>1
        x = (x*x)%p
    return res
 
def gcd(x, y):
    while y:
        x, y = y, x % y
    return x
    
def isPrime(n) : 
    if (n <= 1) : return False
    if (n <= 3) : return True
    if (n % 2 == 0 or n % 3 == 0) : return False
    i = 5
    while(i * i <= n) : 
        if (n % i == 0 or n % (i + 2) == 0) : 
            return False
        i = i + 6
    return True
 
 
 
def read():
    sys.stdin  = open('input.txt', 'r')  
    sys.stdout = open('output.txt', 'w') 
 
 
def main():
    
              
    
    x = int(input())
    if x == 0:
        print('1')
    elif x == 1:
        print('0')
    
    
 


 
BUFSIZE = 8192
 
 
class FastIO(IOBase):
    newlines = 0
 
    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None
 
    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()
 
    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()
 
    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)
 
 
class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")
 
 
def print(*args, **kwargs):
    """Prints the values to a stream, or to sys.stdout by default."""
    sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", "\n"))
    if kwargs.pop("flush", False):
        file.flush()
 
 
if sys.version_info[0] < 3:
    sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
    sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
 
input = lambda: sys.stdin.readline().rstrip("\r\n")
 

 
 
if __name__ == "__main__":
    
    main()

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

if N == 1:
	print("0")
if N == 0:
	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)
if n == 0:
    print(1)

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

Solution (Python):
def main():
    
    x = int(input())
    print(1-x)
if __name__ == "__main__":
    main()

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

if a == 1:
    print(0)

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

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

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

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