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



Sample input:
1


Sample output:
0

Submission status: Accepted

Solution code:
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()
    
#from collections import deque, Counter, OrderedDict,defaultdict
#from heapq import nsmallest, nlargest, heapify,heappop ,heappush, heapreplace
#from math import log,sqrt,factorial,cos,tan,sin,radians
#from bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right
#from decimal import *
#import threading
#from itertools import permutations
#Copy 2D list  m = [x[:] for x in mark] .. Avoid Using Deepcopy
 
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
#mod=998244353
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) : # Check Prime Number or not 
    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():
    
              
    #for _ in range(ii()):
    x = int(input())
    if x == 0:
        print('1')
    elif x == 1:
        print('0')
    
    
 
# region fastio
# template taken from https://github.com/cheran-senthil/PyRival/blob/master/templates/template.py
 
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")
 
# endregion
 
 
if __name__ == "__main__":
    #read()
    main()
    #dmain()
 
# Comment Read()

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
x = int(input())

if x == 0:
    print(1)

else:
    print(0)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    # start coding here...
    x = int(input())
    print(1-x)
if __name__ == "__main__":
    main()

Submission status: Accepted

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

if a == 1:
    print(0)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

Solution code:
import sys
import math
from collections import defaultdict
from bisect import bisect_left, bisect_right

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

mod = 10**9 + 7

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

#################

x = I()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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


main()

Submission status: Accepted

Solution code:
a = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = input()

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

Submission status: Accepted

Solution code:
import sys,bisect
input = sys.stdin.buffer.readline

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a = int(input())

if a == 1 :
    print(0)

if a == 0:
    print(1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

if_1_0(x)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
input = int(input())
if input == 1:
	print(0)
if input == 0:
  	print(1)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

import sys
from typing import Any, Callable, Deque, Dict, List, Mapping, Optional, Sequence, Set, Tuple, TypeVar, Union
# import time
# import math, cmath
# import numpy as np
# import scipy.sparse.csgraph as cs            # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random                                # random, uniform, randint, randrange, shuffle, sample
# import string                                # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from datetime import date, datetime          # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
# from datetime.datetime import strptime       # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
# from datetime import timedelta               # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
# from copy import copy, deepcopy              # use deepcopy to copy multi-dimentional matrix without reference
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import _heapify_max, _heappop_max, _siftdown_max
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from fractions import Fraction               # Fraction(a, b) => a / b ∈ Q. note: Fraction(0.1) do not returns Fraciton(1, 10). Fraction('0.1') returns Fraction(1, 10)



def main():
    Num = Union[int, float]
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79e+308
    # inf = 2 ** 63 - 1             # (for fast JIT compile in PyPy) 9.22e+18
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input():  return sys.stdin.readline().rstrip()
    def ii():     return int(input())
    def isp():    return input().split()
    def mi():     return map(int, input().split())
    def mi_0():   return map(lambda x: int(x)-1, input().split())
    def lmi():    return list(map(int, input().split()))
    def lmi_0():  return list(map(lambda x: int(x)-1, input().split()))
    def li():     return list(input())
    def debug(x): print(x, file=sys.stderr)
    # def _heappush_max(h, item): h.append(item); _siftdown_max(h, 0, len(h)-1)
    
    
    x = ii()
    print(1 if x == 0 else 0)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = input()

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

else:
    print(0)

Submission status: Accepted

Solution code:
x = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

mo=10**9+7
#mo=998244353
inf=float('inf')
FourNb=[(-1,0),(1,0),(0,1),(0,-1)];EightNb=[(-1,0),(1,0),(0,1),(0,-1),(1,1),(-1,-1),(1,-1),(-1,1)];compas=dict(zip('WENS',FourNb));cursol=dict(zip('LRUD',FourNb))
l_alp=string.ascii_lowercase
#sys.setrecursionlimit(10**9)
read=sys.stdin.buffer.read;readline=sys.stdin.buffer.readline;input=lambda:sys.stdin.readline().rstrip()


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

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

show_flg=False
show_flg=True



n=I()

print(1-n)

Submission status: Accepted

Solution code:
a=int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
if int(input()) is 0:
  print(1)
else:
  print(0)

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#import sys
#import numpy as np
import math
#from fractions import Fraction
import itertools
from collections import deque
from collections import Counter
import heapq
#from fractions  import gcd
#input=sys.stdin.readline
import bisect
a=int(input())
if a==0:
    print(1)
else:
    print(0)

Submission status: Accepted

Solution code:
import sys, bisect, math, itertools, string, queue, copy
import numpy as np
import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
# input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplt(n): return [tuple(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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


#input().split()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=int(input())

if a&1:
    print(0)

else:
    print(1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

Solution code:
x = int(input())

if x == 1 :

 print(0)

else:

 print(1)

Submission status: Accepted

Solution code:
x = int(input())
# 標準入力

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

Submission status: Accepted

Solution code:
x = int(input())

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

else:
    print("0")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#-*- Coding: utf-8 -*-

x = int(input())

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
x = int(input(''))

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

print(x)

Submission status: Accepted

Solution code:
def not_func(x):
  if x == 1:
    return 0
  elif x == 0:
    return 1

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

Submission status: Accepted

Solution code:
import numpy as np 

x=int(input(""))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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