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

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

Submission status: Accepted

Solution code:
def main():
    x = input()

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

    print('1')


if __name__ == '__main__':
    main()

Submission status: Accepted

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


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

Submission status: Accepted

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

Submission status: Accepted

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

resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num=int(input())

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

Submission status: Accepted

Solution code:
def solve():

    x = int(input())

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

if __name__ == "__main__":
    solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if not int(input()):
  print(1)
else:
  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:
import sys
from heapq import heappush, heappop, heapify
import math
from math import gcd
import itertools as it
from collections import deque 

input = sys.stdin.readline

def inp():
    return int(input())
def inpl():
    return list(map(int, input().split()))
def dbg(o):
    print(o, file=sys.stderr)

# ---------------------------------------

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
from collections import deque
from functools import lru_cache
import bisect
import copy
import heapq
import itertools
import math
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
mod = 10 ** 9 + 7

def read_values(): return map(int, input().split())
def read_index(): return map(lambda x: int(x) - 1, input().split())
def read_list(): return list(read_values())
def read_lists(N): return [read_list() for n in range(N)]


class Comb:
    def __init__(self, N):
        F = [1] * (N + 1)
        for i in range(N):
            F[i + 1] = (i + 1) * F[i] % mod

        self.d_inv = {}
        self.d_comb = {}
        self.F = F

    def inv(self, a):
        if a not in self.d_inv:
            self.d_inv[a] = pow(a, mod - 2, mod)
        return self.d_inv[a]

    def comb(self, a, b):
        if (a, b) not in self.d_comb:
            self.d_comb[(a, b)] = (self.F[a] * self.inv(self.F[a - b]) * self.inv(self.F[b])) % mod
            self.d_comb[(a, a - b)] = self.d_comb[(a, b)]
        return self.d_comb[(a, b)] 



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

if __name__ == "__main__":
    main()

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)

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

Submission status: Accepted

Solution code:
n=int(input())
print('01'[n!=1])

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys


def main():
    x = int( sys.stdin.readline() )

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
""" A
"""
import sys
import math
from functools import reduce
from bisect import bisect_left

def readString():
    return sys.stdin.readline()

def readInteger():
    return int(readString())

def readStringSet(n):
    return sys.stdin.readline().split(" ")[:n]

def readIntegerSet(n):
    return list(map(int, readStringSet(n)))

def readIntegerMatrix(n, m):
    return [lambda _: readIntegerSet(m) for _ in range(0, n)]

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

if __name__ == "__main__":
    _x = readInteger()

    print(main(_x))

Submission status: Accepted

Solution code:
# cording:utf-8

# xを入力
x = int(input())

# xが0なら
if x == 0:
    # 1を出力
    print("1")
elif x == 1:
    # 0を出力
    print("0")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
input_X = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = 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:
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)
elif x == "0":
  print(1)

Submission status: Accepted

Solution code:
in_n = input().split()
n = int(in_n[0])
if n == 1:
    print(0)
elif n == 0:
    print(1)

Submission status: Accepted

Solution code:
num = int(input())

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

Submission status: Accepted

Solution code:

N = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
import random
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)

if x == 1:
    print(0)

Submission status: Accepted

Solution code:
# region header
import sys, bisect, math, itertools, heapq, collections
from operator import itemgetter
# a.sort(key=itemgetter(i)) # i番目要素でsort
from functools import lru_cache
import copy
# @lru_cache(maxsize=None)
# sys.setrecursionlimit(10**8)
input = sys.stdin.readline
INF = float('inf')
mod = 10**9 + 7
eps = 10**-7
# endregion
# region input function


def inp():
    '''
    一つの整数
    '''
    return int(input())


def inpl():
    '''
    一行に複数の整数
    '''
    return list(map(int, input().split()))


def str_inp():
    '''
    文字列をリストとして読み込む
    '''
    return list(input()[:-1])


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

Submission status: Accepted

Solution code:
import sys
import numpy as np
import math  # gcdもあるよ
from collections import deque
from collections import defaultdict
from copy import deepcopy
from itertools import accumulate #リストを与えると累積和を返す
import bisect #二部探索
def input(): return sys.stdin.readline().rstrip()
from functools import lru_cache #メモ化
mod = 10**9 + 7
INF = 10**9 + 7

def main():
    n = int(input())
    if n == 0:
        print('1')
        return 0
    print('0')
    
    return 0

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=int(input())
if (not a):
  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:
N=int(input())
print(1-N)

Submission status: Accepted

Solution code:
if int(input()) == 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:
#akash mandal: jalpaiguri government engineering college
import sys,math

def ii(): return int(input())
def mii(): return map(int,input().split())
def lmii(): return list(mii())


def main():
    n=ii()
    print(0 if n==1 else 1)
if __name__=="__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math,bisect
sys.setrecursionlimit(10 ** 5)
from collections import defaultdict
from itertools import groupby,accumulate
from heapq import heapify,heappop,heappush
from collections import deque,Counter,OrderedDict
def I(): return int(sys.stdin.readline())
def neo(): return map(int, sys.stdin.readline().split())
def Neo(): return list(map(int, sys.stdin.readline().split()))
n = I()
if n == 1:
    print(0)
else:
    print(1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
i = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 9)
# input = sys.stdin.readline    ####
def int1(x): return int(x) - 1
def II(): return int(input())
def MI(): return map(int, input().split())
def MI1(): return map(int1, input().split())
def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def MS(): return input().split()
def LS(): return list(input())
def LLS(rows_number): return [LS() for _ in range(rows_number)]
def printlist(lst, k=' '): print(k.join(list(map(str, lst))))
INF = float('inf')
# from math import ceil, floor, log2
# from collections import deque, defaultdict
# from itertools import combinations as comb, combinations_with_replacement as comb_w, accumulate, product, permutations
# from heapq import heapify, heappop, heappush
# import numpy as np    # cumsum
# from bisect import bisect_left, bisect_right

def solve():
    x = II()
    print(1-x)

if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf8
# 日本語を入力できるようにするために上記一文が必要

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
x = int(input())

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

Submission status: Accepted

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

X = int(input())

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

Submission status: Accepted

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

solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
str=input()
if str in ("1"):
    print ("0")
else:
    print ("1")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input().rstrip())

if x == 0:
  print("1")
elif x == 1:
  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())
c={0:1,1:0}
print(c[x])

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

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

Submission status: Accepted

Solution code:
def intNot(intX):
    ret = False
    if intX == 0:
        ret = 1
    elif intX==1:
        ret = 0
    return ret

x = int(input())
print(intNot(x))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sun Sep 13 20:38:53 2020

@author: naoki
"""

x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

else:
    n = 0
    print(n)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

Solution code:
if __name__ == "__main__":

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

    print(c)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
i = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import random


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


def lcm(a, b):
    return (a * b) / gcd(a, b)
# a=list(map(int , input().split()))
# ans=-1
# for i in range(4):
#     for j in range(i+1,4):
#         if ans==-1:
#             ans=a[i]*a[j]
#         else:
#             ans=max(ans, a[i]*a[j])
# print(ans)
x=int(input())
if x==1:
    print(0)
else:
    print(1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

print(int(not bool(x)))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = input()
if(x == "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:
# A
x = int(input())
if x % 2 == 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:
import sys
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 MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 10 ** 9 + 7

x = I()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
i = input()
if i == "1":
  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:
from sys import stdin
x = stdin.readline().rstrip()
if x == '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 = input()
if x == "1":
  print(0)
else:
  print(1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

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

def main():
    mod=10**9+7
    x=I()
    if x:
        print(0)
    else:
        print(1)

main()

Submission status: Accepted

Solution code:
str = input()

num = '0'

if str == "0":
  num = '1'
  
print(num)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k = int(input())
"""
a,b = map(int, input().split())
"""
if k == 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:
n = int(input())
if n==0:
  print(1)
else:
  print(0)

Submission status: Accepted

Solution code:
if int(input()) == 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:
def resolve():
    x = int(input())
    print("0" if x == 1 else "1")
    
if '__main__' == __name__:
    resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
x=int(input())

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline

x = int(input())

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

Submission status: Accepted

Solution code:
#coding: UTF-8
x = int(input())
if x:
  print('0')
else:
  print('1')

Submission status: Accepted

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

Submission status: Accepted

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


def solve(x: int):
    print(1 - x)
    return


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    x = int(next(tokens))  # type: int
    solve(x)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
x = int(input())
# h_list = list(map(int, input().split()))

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

Submission status: Accepted

Solution code:
x = int(input())
n = 0

if x == 0:
    n = 1

print(n)

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

elif x == 1:
    print(0)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
'''
Created on 2020/09/13

@author: okazakieiichiro
'''
num = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env pypy3
# N,M = map(int,sys.stdin.readline().split())
# a = tuple(map(int,sys.stdin.readline().split())) # single line with multi param
# a = tuple(int(sys.stdin.readline()) for _ in range(N)) # multi line with single param
# a = tuple(tuple(map(int,sys.stdin.readline().rstrip().split())) for _ in range(N)) # multi line with multi param
# s = sys.stdin.readline().rstrip()
# N = int(sys.stdin.readline())
# INF = float("inf")
import math,sys

x = int(sys.stdin.readline())

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if y==0 :
    print(1)

else:
    print(0)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
x = int(input())
if x == 0:
    print(1)
else:
    print(0)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
a = int(input())
b = 1
# スペース区切りの整数の入力
if a == 1:
    b = 0
# 出力
print("{}".format(b))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
from collections import Counter
from collections import OrderedDict
def inputt():
    return sys.stdin.readline().strip()
def printt(n):
    sys.stdout.write(str(n)+'\n')
def listt():
    return [int(i) for i in inputt().split()]

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

def dfs(src, visit):
    count=1
    visit[src] = 1
    for nbr in dic[src]:
        if nbr==-1:
            continue
        if visit[nbr] == 0:
            count+=dfs(nbr, visit)   
    return count          


t=int(inputt())
if t==0:
    printt(1)
elif t==1:
    printt(0)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:


x = input()

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

Submission status: Accepted

Solution code:
from typing import List, Any


def read_int() -> int:
    return int(input().strip())


def read_ints() -> List[int]:
    return list(map(int, input().strip().split(' ')))


def solve() -> Any:
    x = read_int()
    if x == 0:
        return 1
    return 0


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

Submission status: Accepted

Solution code:
def get(x):
	s = '0'
	if(x == 0):
		s = '1'
	return s

x = int(input())
s = get(x)
print(s)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
numbers = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
readline = stdin.readline
def i_input(): return int(readline().rstrip())
def i_map(): return map(int, readline().rstrip().split())
def i_list(): return list(i_map())


def main():
    print(0 if i_input() == 1 else 1)

if __name__ == "__main__":
    main()