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:
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext
# input = sys.stdin.readline 
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

def main():
    n = i_input()

    print(1-n)

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#n = int(input()) #入力
#a, b = (int(x) for x in input().split())
#a, b = map(int, input().split())

#a = [int(x) for x in input().split()]
#a = list(map(int, input().split()))
#a = [list(map(int,input().split(" "))) for i in range(N)]   #2次元


#a.sort() # C++ の sort(a.begin(), a.end());
#a.append(3) # C++ の a.push_back(3);


#exit(0) # return 0 的な。終了できる。
## 整数の切り捨て除算は // (ダブルスラッシュ)


#a[始まりの位置: 終わりの位置: スライスの増分] # (a は配列)


import numpy as np
import math
import copy
import string
#math.gcd(a, b) で、gcd 計算できる。
#math.pi は円周率。

INF = 10**18 #べき乗 C++ の pow(10, 18) or 1e18;
pi = math.pi

MOD = 1000000007
#MOD = 1000000009
#MOD = 998244353




#繰り返し2乗法
#N^aの、Mで割った余りを求める。
def my_pow(N, a, M):
    if(a == 0):
        return 1
    else:
        if(a % 2 == 0):
            tempo = my_pow(N, a/2, M)
            return (tempo * tempo) % M
        else:
            tempo = my_pow(N, a - 1, M)
            return (tempo * N) % M




#N_C_a を M で割った余り
def my_combination(N, a, M):
    res = 1

    for i in range(0, a):
        res *= N - i
        res %= M

    for i in range(0, a):
        res *= my_pow(i + 1, M - 2, M)
        res %= M

    return res




#N_C_i を M で割った余りを、v[i] に代入する。
def my_combination_table(N, M, v):
    if(len(v) < N + 1):
        l = N + 1 - len(v)
        tempo = [1] * l
        v.extend(tempo)

    for i in range(1, N + 1):
        v[i] = v[i - 1] * (N - (i - 1))
        v[i] %= M

        v[i] *= my_pow(i, M - 2, M)
        v[i] %= M

    return




#math.factorial で階乗は計算できる。
#math.gcd で gcd は計算できる。
#np.gcd.reduce(A) #(Aは配列) で、Aの全ての要素の gcd が計算できる。

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

Submission status: Accepted

Solution code:
print(int(input()) ^ 0x01)

Submission status: Accepted

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

Submission status: Accepted

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


def main():
    import sys
    input = sys.stdin.readline

    x = int(input())

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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


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


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

Submission status: Accepted

Solution code:
# 21:17-                                                                                                                                                      
x = int(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:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    x = int(readline())
    print(0 if x == 1 else 1)


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

Solution code:
x=int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(int(int(input()) == 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())
print(i^1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
x = int(input())
while x == 0:
    x += 1
    print(x)
    exit(0)
while x == 1:
    x -= 1
    print(x)
    exit(0)

Submission status: Accepted

Solution code:

def solve():
    n=int(input())
    print(n^1)

t = 1 #int(input())
for _ in range(t):
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

result = 0 if x == 1 else 1

print(result)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

ans = 1 - x
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:
    x=1
else :
    x=0

print(x)

Submission status: Accepted

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

Submission status: Accepted

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

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(int(input()=='0'))

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

Solution code:


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

Submission status: Accepted

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

if __name__ == '__main__':
  _print()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(int(input()=="0"))

Submission status: Accepted

Solution code:
import sys
print(int(sys.stdin.readline())^1)

Submission status: Accepted

Solution code:
print(int(open(0).read())^1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=int(input())

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
if int(input()):
  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:
# -*- coding: utf-8 -*-

def get_input() -> int:
    """
    標準入力を取得する.

    Returns:\n
        int: 標準入力
    """
    x = int(input())

    return x


def main(x: int) -> None:
    """
    メイン処理.

    Args:\n
        x (int): 整数(0 <= x <= 1)
    """
    # 求解処理
    ans = 1 - x

    # 結果出力
    print(ans)


if __name__ == "__main__":
    # 標準入力を取得
    x = get_input()

    # メイン処理
    main(x)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
x = I()
if x == 0:
    print(1)
else:
    print(0)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

print(x ^ 1)

Submission status: Accepted

Solution code:
def if_3(t1,ans1,t2,ans2,ans3):print(ans1 if t1 else ans2 if t2 else ans3)
def if_2(t1,ans1,ans2):print(ans1 if t1 else ans2)
def YN(t):print("YES" if t else "NO")
def yn(t):print("yes" if t else "no")
def Yn(t):print("Yes" if t else "No")
def main():
  import sys
  pin=sys.stdin.readline
  pout=sys.stdout.write
  perr=sys.stderr.write
  x=int(pin())
  if_2(x==1,0,1)
  return
main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
t = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

print(0 if x else 1)

Submission status: Accepted

Solution code:
##A - Not
x = int(input())
if x == 0:
    print(1)
else:
    print(0)

Submission status: Accepted

Solution code:
d=int(input())

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

  
if __name__ == "__main__":
  main()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin python3
# -*- coding: utf-8 -*-

n = int(input())
print(int(not n))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input().split()
x=int(s[0])
if x==0:
    print("1")
else:
    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==1:
  print(0)
else:
  print(1)

Submission status: Accepted

Solution code:
x = int(input())
#a, b = map(int,input().split())
#l = list(map(int,input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
dic={1:0,0:1}
print(dic[x])

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding:UTF-8
import sys

if __name__ == '__main__':
    # ------ 入力 ------#
    # 1行入力
    a = int(input())    # 数字
    # a = input()     # 文字列
    # a = list(map(int, input().split()))     # スペース区切り連続数字
    # a = input().split()     # スペース区切り連続文字列
    # a = [int(c) for c in input()]   # 数字→単数字リスト変換

    # 定数行入力
    x = 5
    # a = [int(input()) for _ in range(x)] # 数字
    # a = [input() for _ in range(x)] # 文字
    # a = [list(map(int, input().split())) for _ in range(x)]     # スペース区切り連続数字(行列)
    # a = [input().split() for _ in range(x)]     # スペース区切り連続文字
    # a = [[int(c) for c in input()] for _ in range(x)]  # 数字→単数字リスト変換(行列)

    # スペース区切り連続 数字、文字列複合
    # a = []
    # for _ in range(x):
    #     aa, bb = input().split()
    #     a.append((int(aa), bb))

    # ------ 出力 ------#
    if a == 1:
        print("0")
    if a == 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:
print(1&~int(input()))

Submission status: Accepted

Solution code:
import os
import sys
import math
import heapq
from decimal import *
from io import BytesIO, IOBase
from collections import defaultdict, deque

def r():
    return int(input())
def rm():
    return map(int,input().split())
def rl():
    return list(map(int,input().split()))

print(1-r())

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8
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:
N = int(input())
ans = 0 if N else 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
data = int(input())

ans = abs(data-1)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

@author: harurun
'''
def yn(t):
  if t:print("yes")
  else:print("no")
  return
def YN(t):
  if t:print("YES")
  else:print("NO")
  return
def Yn(t):
  if t:print("Yes")
  else:print("No")
  return
def main():
  import sys
  pin=sys.stdin.readline
  pout=sys.stdout.write
  perr=sys.stderr.write

  x=int(pin())
  if x==1:
    print(0)
  else:
    print(1)
  return 
main()

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

print(1 if x == 0 else 0)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin, setrecursionlimit
#input = stdin.buffer.readline
setrecursionlimit(10 ** 7)

from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
from collections import deque, defaultdict, Counter
from itertools import combinations, permutations, combinations_with_replacement
from itertools import accumulate
from math import ceil, sqrt, pi, radians, sin, cos

MOD = 10 ** 9 + 7
INF = 10 ** 18

N = int(input())
#N, M = map(int, input().split())
#A = list(map(int, input().split()))
#A = [int(input()) for _ in range(N)]
#ABC = [list(map(int, input().split())) for _ in range(N)]
#S = input()
#S = [input() for _ in range(N)]

print(1 - N)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
x = int(sys.stdin.readline().rstrip("\n"))
print(1-x)

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline


def solve():
    x = int(rl())
    print(x ^ 1)


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().rstrip()
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)
else:
    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:
ans = '1' 
if input() == '1':
  ans = '0'
print(ans)

Submission status: Accepted

Solution code:
x = int(input())

print(0 if x == 1 else 1)

Submission status: Accepted

Solution code:
x = input()
x = int(x)
# OUTPUTS
# Print 1 if input is equal to 0
if x == 0:
    print(1)
    exit()

# Print 0 if input is equal to 1
if x == 1:
    print(0)
    exit()

Submission status: Accepted

Solution code:
# A - Not
def main():
    X = int(input())
    print(X ^ 1)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
x = int(input())

print(x^1)

Submission status: Accepted

Solution code:
# @uthor : Kaleab Asfaw
from sys import stdin, stdout
# Fast IO
# from math import gcd

def input():
	a = stdin.readline()
	if a[-1] == "\n": a = a[:-1]
	return a
def print(*argv, end="\n", sep=" "):
	n = len(argv)
	for i in range(n):
		if i == n-1: stdout.write(str(argv[i]))
		else: stdout.write(str(argv[i]) + sep)
	stdout.write(end)
# Others
mod = 10**9+7
def lcm(x, y): return (x * y) / (gcd(x, y))
def fact(x, mod=mod):
	ans = 1
	for i in range(1, x+1): ans = (ans * i) % mod
	return ans
def arr2D(n, m, default=0):
	lst = []
	for i in range(n): temp = [default] * m; lst.append(temp)
	return lst
def sortDictV(x): return {k: v for k, v in sorted(x.items(), key = lambda item : item[1])}

def solve(n):
	return 1-n

n = int(input())
print(solve(n))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# cook your dish here
import sys,math
try:sys.stdin,sys.stdout=open('input.txt','r'),open('out.txt','w')
except:pass
from sys import stdin,stdout;mod=int(1e9 + 7);from statistics import mode
from collections import *;from math import ceil,floor,inf,factorial,gcd,log2,sqrt,log
ii1=lambda:int(stdin.readline().strip())
is1=lambda:stdin.readline().strip()
iia=lambda:list(map(int,stdin.readline().strip().split()))
isa=lambda:stdin.readline().strip().split()
# print('{:.3f}'.format(1),round(1.123456789,4))
# sys.setrecursionlimit(500000)
def lcm(a,b): return (a*b)//gcd(a,b)
def setbits(n):return bin(n).count('1')
def resetbits(n):return bin(n).count('0')
def modinv(n,p):return pow(n,p-2,p)
def ncr(n,r):
    num,den=1,1;r=min(n,n-r)
    for i in range(r):num*=(n-i);den*=(i+1)
    return num//den
def ncr_p(n, r, p):
    num,den=1,1;r=min(r,n-r)
    for i in range(r):num = (num * (n - i)) % p ;den = (den * (i + 1)) % p
    return (num * modinv(den,p)) % p
def isPrime(num) :
    if num<=1:return False
    if num==2 or n==3:return True
    if (num % 2 == 0 or num % 3 == 0) :return False
    m = int(num**0.5)+1
    for i in range(5,m,6):
        if (num % i == 0 or num % (i + 2) == 0) :return False
    return True
def bin_search(s, low, high, val):
    while low <= high:
        mid = low + (high - low) // 2;
        if s[mid] == val:return mid
        elif s[mid] < val:low = mid + 1
        else:high = mid - 1
    return -1
def sumofdigit(num):
    count=0;
    while num : count+=num % 10;num //= 10;
    return count;
def inputmatrix():
    r,c=iia();mat=[0]*r;
    for i in range(r):mat[i]=iia();
    return r,c,mat;
def prefix_sum(n,s):
    for i in range(1,n):s[i]+=s[i-1]
    return s;
def binomial(n, k):
    if 0 <= k <= n:
        ntok = 1;ktok = 1
        for t in range(1, min(k, n - k) + 1):ntok *= n;ktok *= t;n -= 1
        return ntok // ktok
    else:return 0
def divisors(n):
    res = [];
    for i in range(1,ceil(sqrt(n))+1):
        if n%i == 0:
            if i==n//i:res.append(i)
            else:res.append(i);res.append(n//i)
    return res;
#code here
n = ii1()
if n==1:print(0)
else:
    print(1)

Submission status: Accepted

Solution code:
#------------------------template--------------------------#
import os
import sys
from math import *
from collections import *
# from fractions import *
# from heapq import*
from bisect import *
from io import BytesIO, IOBase
def vsInput():
    sys.stdin = open('input.txt', 'r')
    sys.stdout = open('output.txt', 'w')
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")
ALPHA='abcdefghijklmnopqrstuvwxyz'
M=10**9+7
EPS=1e-6
def value():return tuple(map(int,input().split()))
def array():return [int(i) for i in input().split()]
def Int():return int(input())
def Str():return input()
def arrayS():return [i for i in input().split()]


#-------------------------code---------------------------#
#vsInput()


print(Int()^1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
print(1-math.ceil(math.sin(int(input()))))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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