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: Wrong Answer

Solution code:
import sys
import collections as cc
import math as mt
I=lambda:list(map(int,input().split()))
n,=I()
if n==1:
	print(1)
else:
	print(0)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**6)
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()

x = na()

print(1 if x==0 else 0)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from functools import reduce
from fractions import gcd
import math
import bisect
import itertools
import sys
input = sys.stdin.readline
INF = float("inf")


# 処理内容
def main():
    print(int(input()) ^ 1)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num = int(input())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#abc178a
x=int(input())
if x==1:

 print(0)
else:
 print(1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=int(input())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = input()

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

Submission status: Accepted

Solution code:
num = int(input())

print(1 if num == 0 else 0)

Submission status: Accepted

Solution code:
n = int(input())

x = 1 - n

print(x)

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

Submission status: Accepted

Solution code:
x=int(input())
ans=1
if x==1:
    ans=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:
import os,sys
n=int(input())
if(n==0):
    print("1")
else:
    print("0")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys,os,platform
if __debug__ and platform.platform()=='Darwin-18.7.0-x86_64-i386-64bit' and os.name=='posix':
    sys.stdin = open('INP01.txt', 'r')  

    # Printing the Output to output.txt file 
    sys.stdout = open('out.txt', 'w') 
x=int(input()) 
print(1-x)

Submission status: Accepted

Solution code:
import sys

# A - Not
x = int(input())

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x  = int(input())

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

Solution code:
import sys
x = int(sys.stdin.read().strip())
print(int(not x))

Submission status: Accepted

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

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([1,0][x])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# URL : https://atcoder.jp/contests/abc178/tasks/abc178_a
print(int(input()) ^ 1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=int(input())

if a==1:

  

  print("0")

if a==0:

  print("1")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

def input():
    return sys.stdin.readline()[:-1]


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

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
    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:
import sys

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


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

# this is to make the code longer than 50 characters

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num= input()

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

    if x == 1:
        print(0)
    else:
        print(1)
    
if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

print(int(not x))

Submission status: Accepted

Solution code:
s = int(input())

if s != 0:
  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:
# -*- coding: utf-8 -*-
from sys import stdin
input = stdin.readline


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

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

Submission status: Accepted

Solution code:
# # Make IO faster
# import sys
# input = sys.stdin.readline

# # get single (or) multiple str
# X = input()

# # get single int
# N = int(input())
# # get multiple int (e.g., 2)
# X, Y = map(int, input().split())
# # get multiple int (e.g., 2) for N lines
# XY = [list(map(int, input().split())) for _ in range(N)]

# from IPython import embed; embed(); exit();

# 全部入り
import sys, re
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
from functools import reduce
import numpy as np
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()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if x ==1:
    print(0)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env pypy
print((int(input())+1)%2)

Submission status: Accepted

Solution code:
#!/usr/bin/env pypy3
print((int(input())+1)%2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
 
def main():
    x = int(readline())
    if x:
        print(0)
    else:
        print(1)

if __name__ == '__main__':
    main()

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^int(input()))

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

if x==1:
    x=0

elif x==0:
    x=1

print(x)

Submission status: Accepted

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

import sys

input = iter(sys.stdin.read().splitlines()).__next__

N = int(input())
res = 1-N
print(res)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())
print(~x & 1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(1000000)




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

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



main()

Submission status: Accepted

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

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)
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())
print((x + 1) % 2)

Submission status: Accepted

Solution code:
if __name__ == '__main__':
  x = int(input())
  print((x + 1) % 2)

Submission status: Accepted

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

print(1-x)

Submission status: Accepted

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

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

else:
    print('0')

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(1 << 25)
readline = sys.stdin.buffer.readline
read = sys.stdin.readline  # 文字列読み込む時はこっち
ra = range
enu = enumerate


def exit(*argv, **kwarg):
    print(*argv, **kwarg)
    sys.exit()


def mina(*argv, sub=1): return list(map(lambda x: x - sub, argv))
# 受け渡されたすべての要素からsubだけ引く.リストを*をつけて展開しておくこと


def a_int(): return int(readline())


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


def read_col(H):
    '''H is number of rows
    A列、B列が与えられるようなとき
    ex1)A,B=read_col(H)    ex2) A,=read_col(H) #一列の場合'''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, readline().split())))
    return tuple(map(list, zip(*ret)))


def read_tuple(H):
    '''H is number of rows'''
    ret = []
    for _ in range(H):
        ret.append(tuple(map(int, readline().split())))
    return ret


def read_matrix(H):
    '''H is number of rows'''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, readline().split())))
    return ret
    # return [list(map(int, read().split())) for _ in range(H)] # 内包表記はpypyでは遅いため


MOD = 10**9 + 7
INF = 2**31  # 2147483648 > 10**9
# default import
from collections import defaultdict, Counter, deque
from operator import itemgetter, xor, add
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right  # , insort_left, insort_right
from functools import reduce
from math import gcd


def lcm(a, b):
    # 最小公倍数
    g = gcd(a, b)
    return a // g * b


print(1 - a_int())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def check_x(x: int) -> int:
    return 1 if x == 0 else 0

if __name__=='__main__':
    print(check_x(int(input())))

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import bisect, collections, copy, heapq, itertools, math, string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int, sys.stdin.readline().rstrip().split())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())

from collections import defaultdict
from collections import deque
import bisect
from decimal import *
def main():
    x = I()
    if x == 0:
        print(1)
    else:
        print(0)

if __name__ == "__main__":
    main()

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

Submission status: Accepted

Solution code:
x=input()

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#! /usr/bin/python3

print(int(input())^1)

Submission status: Accepted

Solution code:
#! /usr/bin/python3

print(1-int(input()))

Submission status: Accepted

Solution code:
#! /usr/bin/python3

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

Submission status: Accepted

Solution code:
#! /usr/bin/python3

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

Submission status: Accepted

Solution code:
#! /usr/bin/python3

x = int(input())

print(x^1)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num = input()
if num == '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())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections
from decimal import Decimal # 10進数で考慮できる

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))

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

x = x ^ 1
print(x)

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

Solution code:
if input() == '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 math
from decimal import *
import random

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    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)