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

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

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

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

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

Solution (Python):

"""
Created on Sun Sep  6 20:55:48 2020

@author: NEC-PCuser
"""

N = int(input())

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

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

    n = int(input().rstrip())
    print(1 if n == 0 else 0)

if __name__ == "__main__":
    resolve()

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

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

Solution (Python):

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

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

Solution (Python):
def main():
    from sys import stdin

    readline = stdin.readline

    x=int(readline())

    print(int(not(x)))

main()

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

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

Solution (Python):
import sys
from sys import stdin,stdout
import math
import random
import heapq
from collections import Counter
from functools import lru_cache

try:
    for _ in range(1):
        x=int(input())
        if x==0:
            print(1)
        else:
            print(0)






    
except EOFError as e:
    print(e)

Solution (Python):
import os
import heapq
import sys,threading
import math as mt
import operator
from copy import copy
from collections import defaultdict,deque
from io import BytesIO, IOBase

sys.setrecursionlimit(2*10 ** 5)



def gcd(a, b):
    if b == 0:
        return a
    else:
        return gcd(b, a % b)


"""def pw(a,b):
    result=1
    while(b>0):
        if(b%2==1): result*=a
        a*=a
        b//=2
    return result"""


def inpt():
    return [int(k) for k in input().split()]

def main():
    n=int(input())
    ans=n^1
    print(ans)





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

Solution (Python):

import sys
input = sys.stdin.readline  
x = int(input())
ans =1
if x==1:
    ans =0
print(ans)

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

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

Solution (Python):

import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from collections import deque
from functools import lru_cache
import bisect
import re
import queue
import copy
import decimal


class Scanner():
    @staticmethod
    def int():
        return int(sys.stdin.readline().rstrip())

    @staticmethod
    def string():
        return sys.stdin.readline().rstrip()

    @staticmethod
    def map_int():
        return [int(x) for x in Scanner.string().split()]

    @staticmethod
    def string_list(n):
        return [Scanner.string() for i in range(n)]

    @staticmethod
    def int_list_list(n):
        return [Scanner.map_int() for i in range(n)]

    @staticmethod
    def int_cols_list(n):
        return [Scanner.int() for i in range(n)]


def solve():
    x = Scanner.int()
    if x == 0:
        print(1)
    else:
        print(0)


def main():
    
    
    
    
    solve()


if __name__ == "__main__":
    main()

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

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

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

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

Solution (Python):
import sys
N=int(sys.stdin.readline().strip())
print 0 if N==1 else 1

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

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

Solution (Python):



C = input()




if C == "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(0 if x == 1 else 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):
import sys



def input():
    return sys.stdin.readline().strip()


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


def input_int_list():
    return [int(i) for i in input().split()]


def main():
    n = input_int()
    if n == 0:
        print(1)
    else:
        print(0)

    return


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

Solution (Python):



import sys

x = int(input())

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

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

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

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

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

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

Solution (Python):


from typing import *




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

def main():
    x = int(input())
    a = solve(x)
    print(a)

if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
def readinput():
    n=int(input())
    return n

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

if __name__=='__main__':
    n=readinput()
    ans=main(n)
    print(ans)

Solution (Python):

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

  print(1 if N == 0 else 0)

if __name__ == "__main__":
  resolve()

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

if __name__ == '__main__':
    main()

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

Solution (Python):



import collections
import sys
import copy
import re
import math


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


def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))


def S(): return sys.stdin.readline().rstrip()


def LS(): return list(sys.stdin.readline().rstrip().split())


def main():
    N = I()
    if N == 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 = input()

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

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

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

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

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

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

Solution (Python):

import collections as cl
import sys


def II():
    return int(sys.stdin.readline())


def MI():
    return map(int, sys.stdin.readline().split())


def LI():
    return list(map(int, sys.stdin.readline().split()))


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


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

print(int(a!=True))

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

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

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

Solution (Python):
x = input()

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

Solution (Python):



import sys


def std_in():
    return sys.stdin.readline().strip()


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

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


if __name__ == "__main__":
    main()

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

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

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

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

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

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 == 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 == "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())
print(int(not x))

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

Solution (Python):
a = input().split()
a=a[0]
if int(a)==0:
  print("1")
else:
  print("0")

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

ans=1

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

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

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

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

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

x = int(input())

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

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

print(int(n == 0))

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

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

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

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

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

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


if __name__ == "__main__":
    x = int(input())
    print(solve(x))

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

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

if __name__ == "__main__":
    solve()

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

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

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

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

Solution (Python):
import math,sys,bisect,heapq
from collections import defaultdict,Counter,deque
from itertools import groupby,accumulate

int1 = lambda x: int(x) - 1
input = iter(sys.stdin.buffer.read().decode().splitlines()).__next__
ilele = lambda: map(int,input().split())
alele = lambda: list(map(int, input().split()))
ilelec = lambda: map(int1,input().split())
alelec = lambda: list(map(int1, input().split()))
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]

def Y(c):  print(["NO","YES"][c])
def y(c):  print(["no","yes"][c])
def Yy(c):  print(["No","Yes"][c])
    
x = int(input())
if x == 1:
    print(0)
else:
    print(1)

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

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

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

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

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

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

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

Solution (Python):


import sys

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

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

if i == 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())
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):

import sys
sys.setrecursionlimit(1000000)
from collections import deque


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):
import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

Solution (Python):
import sys

def resolve(in_):
    x = int(next(in_))
    return 1 if x == 0 else 0
    

def main():
    answer = resolve(sys.stdin.buffer)
    print(answer)


if __name__ == '__main__':
    main()

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

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

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

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

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

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

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

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

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

import os
from sys import stdin, stdout
    
def solve(tc):
    a = int(stdin.readline().strip())
    print(1 if a==0 else 0)
    
    
tcs = 1
tc = 1
while tc <= tcs:
    solve(tc)
    tc += 1

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

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):
print(int(not 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");
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):
import sys
import collections as cc
import math as mt
I=lambda:list(map(int,input().split()))
n,=I()
if n==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())
print(1-x)

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

Solution (Python):

import sys


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



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

if __name__ == '__main__':
    main()

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


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

print(ans)

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):
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())
print((x+1)%2)

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

Solution (Python):
import sys
def input():
    return sys.stdin.readline()[:-1]


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

    
if __name__ == "__main__":
    main()

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

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

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

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

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

import sys;input = sys.stdin.readline
inp,ip = lambda :int(input()),lambda :[int(w) for w in input().split()]

n = inp()
print((n+1)%2)

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

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

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

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

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

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

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):
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):
import math
import itertools



def calc_digit_sum(num):
    digits = sums = 0
    while num > 0:
        digits += 1
        sums += num % 10
        num //= 10
    return digits, sums


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

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

ans = 1
if x == 1:
    ans = 0

print(ans)

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

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

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

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

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

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

Solution (Python):
import copy
import math
import time
import statistics
import math
import itertools
import bisect
import sys
from decimal import *
from collections import deque


def get_int():
    return int(input())

def get_string():
    return input()

def get_int_list():
    return [int(x) for x in input().split()]

def get_string_list():
    return input().split()

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

def get_string_char_list():
    return list(str(input()))



sys.setrecursionlimit(10 ** 6)

def main():
    start = time.time()

    if get_int() == 0:
        ans = 1
    else:
        ans = 0
    print(ans)


if __name__ == '__main__':
    main()

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

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

Solution (Python):
def resolve():
    '''
    code here
    '''
    x = int(input())

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


if __name__ == "__main__":
    resolve()

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

Solution (Python):













import math
import collections





def gcd(a,b):
  if a==0:
    return b
  return gcd(b%a,a)

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

def min(a,b):
  if a<b:
    return a
  else:
    return b

def sw(a,b):
  a,b=b,a


n=int(input())

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

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

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

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

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

Solution (Python):




import sys
from io import StringIO
import unittest

def yn(b):
    print("Yes" if b==1 else "No")
    return

def resolve():
    readline=sys.stdin.readline

    
    
    x=int(readline())

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

    return

if 'doTest' not in globals():
    resolve()
    sys.exit()

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

Solution (Python):




import sys
input = sys.stdin.readline



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

    if x == 0:
        res = 1
    else:
        res = 0

    print(res)



main()

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


if __name__ == "__main__":
    main()

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

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

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

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

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

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

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

if __name__ == "__main__":
    main()

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

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

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

Solution (Python):
import sys

input_ = sys.stdin.readline

x = int(input_().strip())

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

print(int(x==0))

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

Solution (Python):
from __future__ import print_function

import sys
sys.setrecursionlimit(500000)

import re
import array
import copy
import functools
import operator

import math
import string
import fractions
from fractions import Fraction

import collections
import itertools
import bisect

import random
import time

import heapq
from heapq import heappush
from heapq import heappop
from heapq import heappushpop
from heapq import heapify
from heapq import heapreplace
from queue import PriorityQueue as pq
from queue import Queue

from itertools import accumulate

from collections import deque
from collections import Counter

from operator import mul
from functools import reduce

input = sys.stdin.readline


def eprint(*args, **kwargs):
    print(*args, file=sys.stderr, **kwargs)
    return


















def combinations_count(n, r):
    r = min(r, n - r)
    numer = reduce(mul, range(n, n - r, -1), 1)
    denom = reduce(mul, range(1, r + 1), 1)
    return numer // denom


mod=1000000007
def combinations_count_mod(n, r):
    r = min(r, n - r)
    numer = reduce(lambda x,y: x*y%mod, range(n, n - r, -1), 1)
    denom = pow( reduce(lambda x,y: x*y%mod, range(1, r + 1), 1) , mod-2, mod)
    return numer * denom % mod


def solve():
    pass

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


if __name__ == '__main__':
    main()

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

Solution (Python):

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