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


import sys
import math
import time

import collections
from collections import deque
from collections import Counter
import queue
import copy
import bisect
import heapq
import itertools











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

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

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

Solution (Python):

import sys


def solve(x: int):
    if x == 1:
        print(0)
    elif x == 0:
        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):
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):
from sys import stdin
input = stdin.readline

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
stdin = sys.stdin
sys.setrecursionlimit(10**6)
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()

x = ni()

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
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 input()=='1' else 1)

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

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

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

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

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

Solution (Python):


x=int(input())
print((x+1)%2)

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

Solution (Python):
from sys import setrecursionlimit
from collections import Counter
from collections import defaultdict
from collections import deque
from heapq import heapify
from heapq import heappop
from heapq import heappush
from time import time
setrecursionlimit(10**9)
mod=10**9+7
inf=10**18

x=int(input())

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

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):
def main():

    a = int(input())

    if a ==0 :
        print(1)
    else:
        print(0)
if __name__=='__main__':
    main()

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

Solution (Python):

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

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

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

Solution (Python):


import sys
iim = lambda: map(int, sys.stdin.readline().rstrip().split())

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

    print([1, 0][s])

if __name__ == "__main__":
    resolve()

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

Solution (Python):
from sys import stdin
inp = lambda : stdin.readline().strip()

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

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

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

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

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

Solution (Python):
import sys

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

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

print(1-x)

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

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):
def main():
    import sys
    print(int(not int(input())))

main()

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

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

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

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

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

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

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

Solution (Python):
def main():
    n = int(not(bool(int(input()))))
    return n


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

Solution (Python):

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

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

import os,sys
from io import BytesIO, IOBase

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

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

main()

Solution (Python):
import queue
import numpy as np
import math

class UnionFind:
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())



dir4 = [[-1, 0], [1, 0], [0, -1], [0, 1]]

a = int(input())




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

if __name__ == "__main__":
    main()

Solution (Python):
i1=lambda : input()
i2=lambda : int(input())
i3=lambda : map(int,input().split())
i4=lambda n : [list(map(int,input().split()) for _ in range(n))]

X=i2()
print(1 if X==0 else 0)

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

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

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

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

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

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

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

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

if a == 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(readline())

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

Solution (Python):
import sys


x = int(input())






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

Solution (Python):




n = int(input())


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

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

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

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

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

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

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

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

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

Solution (Python):
from sys import stdin
import math
inp = lambda : stdin.readline().strip()

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

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

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

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

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

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

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

Solution (Python):
from sys import stdin
def ip(): return [int(i) for i in stdin.readline().split()]
def sp(): return [str(i) for i in stdin.readline().split()]


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

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

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 li():
    return [int(x) for x in input().split()]


x = int(input())

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

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

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

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

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

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

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

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

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

Solution (Python):
import sys


def main():
    N = int(sys.stdin.readline().rstrip())

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


main()

Solution (Python):
import sys
from io import StringIO
import unittest
import os


sys.setrecursionlimit(999999999)



def resolve(test=""):
    try:
        n = int(input())

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


    except IndexError as err:
        print("インデックスエラー:", err.args[0])



class TestClass(unittest.TestCase):
    def assertIO(self, assert_input, output):
        stdout, sat_in = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(assert_input)
        resolve(sys._getframe().f_back.f_code.co_name)
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, sat_in
        self.assertEqual(out, output)

    def test_input_1(self):
        test_input = """1"""
        output = """0"""
        self.assertIO(test_input, output)

    def test_input_2(self):
        test_input = """0"""
        output = """1"""
        self.assertIO(test_input, output)

    
    def test_original(self):
        pass



def list_to_tsv(target: [], limit_row: int = 0, limit_column: int = 0) -> str:
    
    if limit_row is not 0:
        target = target[:limit_row]
    if limit_column is not 0:
        target = [i[:limit_column] for i in target]

    
    target = [[cnt] + i for cnt, i in enumerate(target)]  
    target.insert(0, [i for i in range(len(target[0]))])  
    
    result = ""
    for a in target:
        result += '\t'.join(map(str, a)) + '\r\n'
    return result



if __name__ == "__main__":
    if os.environ.get("USERNAME") is None:
        
        resolve()

    else:
        
        unittest.main(verbosity=2)

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

Solution (Python):

from math import floor, ceil, sqrt, factorial, log, gcd
from itertools import accumulate, permutations, combinations, product, combinations_with_replacement
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from heapq import heappop, heappush, heappushpop, heapify
import copy
import sys
INF = float('inf')
mod = 10**9+7
sys.setrecursionlimit(10 ** 6)


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





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




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





def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()




def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')







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 main():
    a = I()
    if a == 0:
        print(1)
    elif a == 1:
        print(0)


if __name__ == "__main__":
    main()

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

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

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

Solution (Python):
import time
startTimeProblem=time.time()

import fileinput, sys, itertools, functools
from math import *
from bisect import *
from heapq import *
from collections import *

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

class InputHelper:
    def __init__(self):
        self.myinput = fileinput.input()

    def isLocal(self):
        return not fileinput.isstdin()

    def int(self):
        return int(self.myinput.readline().rstrip())

    def ints(self):
        return [int(_) for _ in self.myinput.readline().rstrip().split()]

    def str(self):
        return self.myinput.readline().rstrip()

    def strs(self):
        return [_ for _ in self.myinput.readline().rstrip().split()]

class OutputHelper:
    def int(self, a):
        print(a)    

    def ints(self, a):  
        print(" ".join([str(_) for _ in a]))
    
    def intsNL(self, a):
        for _ in a:
            print(_)
    
    def str(self, s):
        print(s)

    def strs(self, s):
        print(" ".join([_ for _ in s]))

    def strsNL(self, s):
        for st in s:
            print(st)

class ListNode:
    def __init__(self, val):
        self.val = val
        self.next = None
        self.prev = None

In = InputHelper()
Out = OutputHelper()



x = In.int()

if x==0:
    Out.int(1)
else:
    Out.int(0)



if len(sys.argv)>2 and sys.argv[2]=="TIMEIT":
    fin = (time.time()-startTimeProblem)*1000
    print("{:.2f}".format(fin) + "ms")

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

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

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

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

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

Solution (Python):
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
import math
def get_array(): return list(map(int, sys.stdin.readline().strip().split()))
def get_ints(): return map(int, sys.stdin.readline().strip().split())
def input(): return sys.stdin.readline().strip()
x=int(input())
if x==0:
    print(1)
elif x==1:
    print(0)

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

answer = [1,0]

print(answer[x])

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

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

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

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

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

print(1 if N == 0 else 0)

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

print(1 - x)

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

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

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

Solution (Python):









import os
import sys




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


if __name__ == "__main__":
    main()

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

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

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

Solution (Python):
if __name__ == '__main__':
    a = int(input())

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

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

print((1-x))

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

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

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

Solution (Python):
import sys
input = sys.stdin.readline
def main():
    s = int(input())
    if s == 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 os
import heapq
import sys,threading
import math
import bisect
import operator
from collections import defaultdict
sys.setrecursionlimit(10**5)
from io import BytesIO, IOBase
def gcd(a,b):
    if b==0:

        return a
    else:
        return gcd(b,a%b)
def power(x, p,m):
    res = 1
    while p:
        if p & 1:
            res = (res * x) % m
        x = (x * x) % m
        p >>= 1
    return res
def inar():
    return [int(k) for k in input().split()]

def lcm(num1,num2):
    return (num1*num2)//gcd(num1,num2)

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


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

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

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

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

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

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

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

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

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

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

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

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

print(1-x)

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

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

ans = 1-x
print(ans)

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

Solution (Python):
X, = [int(x) for x in input().split()]
if X == 0:
    print(1)
elif X == 1:
    print(0)

Solution (Python):
import sys

def dump(x):
    print(x, file=sys.stderr)


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











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

Solution (Python):










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




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

if __name__ == '__main__':
    main()

Solution (Python):




import sys
import heapq, functools, collections
import random
from collections import Counter, defaultdict





k = int(input())







print(1-k)

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

Solution (Python):

import sys

input = sys.stdin.readline


def ST():
    return input().rstrip()


def I():
    return int(input())


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


def LI():
    return list(MI())


x = I()
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):
import math
from collections import defaultdict
ml=lambda:map(int,input().split())
ll=lambda:list(map(int,input().split()))
ii=lambda:int(input())
ip=lambda:input()

"""========main code==============="""


t=1
for _ in range(t):
    x=ii()
    if(x==0):
        print(1)
    else:
        print(0)

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

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

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

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

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

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

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

Solution (Python):
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):
def solve(x):
    return 1 - x


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


def test():
    assert solve(1) == 0
    assert solve(0) == 1
    

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

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

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

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

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

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

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

if __name__ == "__main__":
    main()

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

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

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

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

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

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

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