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

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

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

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 sys

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

in_n = lambda: int(readline())
in_nn = lambda: map(int, readline().split())
in_s = lambda: readline().rstrip().decode('utf-8')
in_nl = lambda: list(map(int, readline().split()))
in_nl2 = lambda H: [in_nl() for _ in range(H)]
in_map = lambda: [s == ord('.') for s in readline() if s != ord('\n')]
in_map2 = lambda H: [in_map() for _ in range(H)]
in_all = lambda: map(int, read().split())


def main():
    x = in_n()

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


if __name__ == '__main__':
    main()

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

Solution (Python):

from collections import defaultdict, deque, Counter, OrderedDict
from bisect import bisect_left, bisect_right
from functools import reduce, lru_cache
from heapq import heappush, heappop, heapify

import itertools
import math, fractions
import sys, copy

def L(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline().rstrip())
def SL(): return list(sys.stdin.readline().rstrip())
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI1(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LS(): return [list(x) for x in sys.stdin.readline().split()]
def R(n): return [sys.stdin.readline().strip() for _ in range(n)]
def LR(n): return [L() for _ in range(n)]
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def LIR1(n): return [LI1() for _ in range(n)]
def SR(n): return [SL() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]

def perm(n, r): return math.factorial(n) // math.factorial(r)
def comb(n, r): return math.factorial(n) // (math.factorial(r) * math.factorial(n-r))

def make_list(n, *args, default=0): return [make_list(*args, default=default) for _ in range(n)] if len(args) > 0 else [default for _ in range(n)]

dire = [[1, 0], [0, 1], [-1, 0], [0, -1]]
dire8 = [[1, 0], [1, 1], [0, 1], [-1, 1], [-1, 0], [-1, -1], [0, -1], [1, -1]]
alphabets = "abcdefghijklmnopqrstuvwxyz"
ALPHABETS = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
MOD = 1000000007
INF = float("inf")

sys.setrecursionlimit(1000000)

def main():
    N = I()
    print(int(not bool(N)))

if __name__ == '__main__':
    main()

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

Solution (Python):
import math

i = int(input())

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

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


main()

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

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

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

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

Solution (Python):


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

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

Solution (Python):
print input()^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):
import sys

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


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


print(solve())

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 sys


def _i(): return int(sys.stdin.readline().strip())


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


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

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

ans = 1 - x
print(ans)

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
a = input()

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

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

Solution (Python):


a=int(input())








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

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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(1000000000)
import math
from math import gcd
def lcm(a, b): return a * b // gcd(a, b)
from itertools import count, permutations, combinations, chain, product
from functools import lru_cache
from collections import deque, defaultdict
from operator import itemgetter
from pprint import pprint
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
INF = float('inf')
N1097 = 10**9 + 7

def meg(f, ok, ng):
    while abs(ok-ng)>1:
        mid = (ok+ng)//2
        if f(mid):
            ok=mid
        else:
            ng=mid
    return ok

def get_inv(n, modp):
    return pow(n, modp-2, modp)

def factorials_list(n, modp):    
    fs = [1]
    for i in range(1, n+1):
        fs.append(fs[-1] * i % modp)
    return fs

def invs_list(n, fs, modp):     
    invs = [get_inv(fs[-1], modp)]
    for i in range(n, 1-1, -1):
        invs.append(invs[-1] * i % modp)
    invs.reverse()
    return invs

def comb(n, k, modp):
    num = 1
    for i in range(n, n-k, -1):
        num = num * i % modp
    den = 1
    for i in range(2, k+1):
        den = den * i % modp
    return num * get_inv(den, modp) % modp

def comb_from_list(n, k, modp, fs, invs):
    return fs[n] * invs[n-k] * invs[k] % modp



class UnionFindEx:
    def __init__(self, size):
        
        self.roots = [-1] * size
    def getRootID(self, i):
        r = self.roots[i]
        if r < 0:   
            return i
        else:
            r = self.getRootID(r)
            self.roots[i] = r
            return r
    def getGroupSize(self, i):
        return -self.roots[self.getRootID(i)]
    def connect(self, i, j):
        r1, r2 = self.getRootID(i), self.getRootID(j)
        if r1 == r2:
            return False
        if self.getGroupSize(r1) < self.getGroupSize(r2):
            r1, r2 = r2, r1
        self.roots[r1] += self.roots[r2]    
        self.roots[r2] = r1
        return True

Yes = 'Yes'
No = 'No'

from pprint import pprint

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




main()

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

Solution (Python):


import sys

class ANot:
    def solve(self, tc=0):
        x = int(input())
        print(1 - x)


solver = ANot()
input = sys.stdin.readline

solver.solve()

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

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

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

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

Solution (Python):
def inp():
    return input()
def iinp():
    return int(input())
def inps():
    return input().split()
def miinps():
    return map(int,input().split())
def linps():
    return list(input().split())
def lmiinps():
    return list(map(int,input().split()))
def lmiinpsf(n):
    return [list(map(int,input().split()))for _ in range(n)]

x = iinp()

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

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

Solution (Python):
import sys, math
from collections import defaultdict, deque, Counter
from bisect import bisect_left, bisect_right
from itertools import combinations, permutations, product
from heapq import heappush, heappop
from functools import lru_cache
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mat = lambda x, y, v: [[v]*y for _ in range(x)]
ten = lambda x, y, z, v: [mat(y, z, v) for _ in range(x)]
mod = 1000000007
sys.setrecursionlimit(1000000)

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

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

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

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

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

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

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

Solution (Python):
from math import gcd

from math import factorial as f

from math import ceil, floor, sqrt
import math

import bisect
import re
import heapq

from copy import deepcopy
import itertools
from itertools import permutations

from sys import exit

ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(map(int, input().split()))

yes = "Yes"
no = "No"


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




main()

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

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

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return [int(x) for x in sys.stdin.readline().split()]

def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

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


print(main())

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

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

Solution (Python):

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

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

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

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

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

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

print(1-x)

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
from collections import Counter
import sys

sys.setrecursionlimit(10 ** 6)

mod = 1000000007
inf = int(1e18)


def main():
    a=int(input())
    print(a^1)
main()

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

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

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

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

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

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

Solution (Python):
n = int(input().rstrip())
if n == 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):

import sys, re
from decimal import *
from collections import deque, defaultdict, Counter, OrderedDict
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, floor, trunc, log
from heapq import heappush, heappop, heapify, nlargest, nsmallest
def STR(): return list(input())
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def list2d(a, b, c): return [[c] * b for i in range(a)]
def sortListWithIndex(listOfTuples, idx):   return (sorted(listOfTuples, key=lambda x: x[idx]))
def sortDictWithVal(passedDic):
    temp = sorted(passedDic.items(), key=lambda kv: (kv[1], kv[0]))
    toret = {}
    for tup in temp:
        toret[tup[0]] = tup[1]
    return toret
def sortDictWithKey(passedDic):
    return dict(OrderedDict(sorted(passedDic.items())))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

x = INT()

print(x^1)

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


main()

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


def main():
    _in = [_.rstrip() for _ in stdin.readlines()]
    x = int(_in[0])  
    
    ans = 1 if x==0 else 0
    
    print(ans)


if __name__ == "__main__":
    main()

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

Solution (Python):


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

Solution (Python):
S=lambda:input()
I=lambda:int(input())
L=lambda:list(map(int,input().split()))
LS=lambda:list(map(str,input().split()))

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

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

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

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

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

Solution (Python):








x = int(input())

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

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

Solution (Python):


import sys
stdin = sys.stdin

def ns(): return stdin.readline().rstrip()
def ni(): return int(ns())
def na(): return list(map(int, stdin.readline().split()))

def main():
    x = ni()
    print(abs(x-1))

if __name__ == "__main__":
    main()

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

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

print((x+1)%2)

Solution (Python):
if __name__ == "__main__":
    print(int(input())^1)

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 I(): return int(input())
def LI(): return list(map(int, input().split()))
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 S(): return input()
def LS(): return input().split()


INF = float('inf')


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

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

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

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

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

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

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

Solution (Python):
import sys

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

x = I()
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 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(readline())
if N == 1:
    print(0)
else:
    print(1)

Solution (Python):
import sys

input = sys.stdin.readline


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

Solution (Python):

import bisect
import heapq
import math
import random
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from fractions import Fraction
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations, accumulate
from operator import add, mul, sub, itemgetter, attrgetter


import sys


readline = sys.stdin.readline

INF = 1 << 60


def read_int():
    return int(readline())


def read_int_n():
    return list(map(int, readline().split()))


def read_float():
    return float(readline())


def read_float_n():
    return list(map(float, readline().split()))


def read_str():
    return readline().strip()


def read_str_n():
    return readline().strip().split()


def ep(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.perf_counter()
        ret = f(*args, **kwargs)
        e = time.perf_counter()

        ep(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(N):
    return 1 if N == 0 else 0


def main():
    N = read_int()
    print(slv(N))


if __name__ == '__main__':
    main()

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

Solution (Python):
import sys
input=sys.stdin.readline
sys.setrecursionlimit(10 ** 8)
from itertools import accumulate
from itertools import permutations
from itertools import combinations
from collections import defaultdict
from collections import Counter
import fractions
import math
from collections import deque
from bisect import bisect_left
from bisect import bisect_right
from bisect import insort_left
import itertools
from heapq import heapify
from heapq import heappop
from heapq import heappush
import heapq
from copy import deepcopy
from decimal import Decimal
alf = list("abcdefghijklmnopqrstuvwxyz")
ALF = list("ABCDEFGHIJKLMNOPQRSTUVWXYZ")

INF = float("inf")


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

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

Solution (Python):
import sys
input = lambda: sys.stdin.readline().rstrip("\r\n")

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

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

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

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

if x == 0:
    print(1)

if x == 1:
    print(0)

Solution (Python):

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

Solution (Python):
import bisect,collections,copy,itertools,math,string
import sys
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():
    print(0 if I()==1 else 1)
main()

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

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

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

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

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

print(0 if N == 1 else 1)

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

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

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

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

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

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