Problem:


Score : 100 points

Problem Statement

Given is an integer x that is greater than or equal to 0, and less than or equal to 1.
Output 1 if x is equal to 0, or 0 if x is equal to 1.

Constraints

0 \leq x \leq 1

x is an integer

Input

Input is given from Standard Input in the following format:

x

Output

Print 1 if x is equal to 0, or 0 if x is equal to 1.

Sample Input 1

1

Sample Output 1

0

Sample Input 2

0

Sample Output 2

1



Sample input:
1


Sample output:
0

Submission status: Accepted

Solution code:
from __future__ import print_function

import sys
sys.setrecursionlimit(500000)

import re
import array
import copy
import functools
import operator

import math
import string
import fractions
from fractions import Fraction

import collections
import itertools
import bisect

import random
import time

import heapq
from heapq import heappush
from heapq import heappop
from heapq import heappushpop
from heapq import heapify
from heapq import heapreplace
from queue import PriorityQueue as pq
from queue import Queue

from itertools import accumulate

from collections import deque
from collections import Counter

from operator import mul
from functools import reduce

input = sys.stdin.readline


def eprint(*args, **kwargs):
    print(*args, file=sys.stderr, **kwargs)
    return

# from fractions import gcd
# from math import gcd

# def lcm(n, m):
#     return int(n * m / gcd(n, m))


# def coprimize(p, q):
#     common = gcd(p, q)
#     return (p // common, q // common)


# def find_gcd(list_l):
#     x = reduce(gcd, list_l)
#     return x


def combinations_count(n, r):
    r = min(r, n - r)
    numer = reduce(mul, range(n, n - r, -1), 1)
    denom = reduce(mul, range(1, r + 1), 1)
    return numer // denom


mod=1000000007
def combinations_count_mod(n, r):
    r = min(r, n - r)
    numer = reduce(lambda x,y: x*y%mod, range(n, n - r, -1), 1)
    denom = pow( reduce(lambda x,y: x*y%mod, range(1, r + 1), 1) , mod-2, mod)
    return numer * denom % mod


def solve():
    pass

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding:utf-8

import sys
import math
import time
#import numpy as np
import collections
from collections import deque
from collections import Counter
import queue
import copy
import bisect
import heapq
import itertools


#sys.setrecursionlimit(10**7)
#N, Q = map(int, input().split())
#G = [list(input()) for i in range(H)]
#INF = V * 10001
#A = [int(i) for i in input().split()]
#AB = [list(map(int, input().split())) for _ in range(K)]
#CW = [list(map(int, list(input()))) for _ in range(H)]


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

Submission status: Accepted

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


def solve(x: int):
    if x == 1:
        print(0)
    elif x == 0:
        print(1)
    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:
from sys import stdin
input = stdin.readline

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

Submission status: Accepted

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

print(1 if x==0 else 0)

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
value = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
def main():
    s = int(input())
    if(s == 0):
        print(1)
    else:
        print(0)
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#one, two, three, four, five = map(int, input().split())
#li = list(map(int, input().split()))
x=int(input())
print((x+1)%2)

Submission status: Accepted

Solution code:
from sys import setrecursionlimit
from collections import Counter
from collections import defaultdict
from collections import deque
from heapq import heapify
from heapq import heappop
from heapq import heappush
from time import time
setrecursionlimit(10**9)
mod=10**9+7
inf=10**18

x=int(input())

print(0 if x== 1 else 1)

Submission status: Accepted

Solution code:
def main():

    a = int(input())

    if a ==0 :
        print(1)
    else:
        print(0)
if __name__=='__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!python3

import sys
iim = lambda: map(int, sys.stdin.readline().rstrip().split())

def resolve():
    s = int(input())

    print([1, 0][s])

if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
inp = lambda : stdin.readline().strip()

n = int(inp())
if n == 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 math

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

Submission status: Accepted

Solution code:
import sys

def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def main():
    x = I()
    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)
else:
        print(0)

Submission status: Accepted

Solution code:
x  = int(input())

print(1-x)

Submission status: Accepted

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

Submission status: Accepted

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

main()

Submission status: Accepted

Solution code:
def main():
    i = int(input())
    if i == 1:
        print(0)
    else:
        print(1)    
    
    
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    n = int(not(bool(int(input()))))
    return n


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

Submission status: Accepted

Solution code:
#!/usr/bin/python
i = int(input())
print(1 if i == 0 else 0)

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# by the authority of GOD
import os,sys
from io import BytesIO, IOBase

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

#Fast IO Region
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")

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

main()

Submission status: Accepted

Solution code:
import queue
import numpy as np
import math

class UnionFind:
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())



dir4 = [[-1, 0], [1, 0], [0, -1], [0, 1]]

a = int(input())
# n, k = map(int, input().split())
# maze = [list(input()) for _ in range(H)]
# a = list(map(int, input().split()))

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

Submission status: Accepted

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

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
i1=lambda : input()
i2=lambda : int(input())
i3=lambda : map(int,input().split())
i4=lambda n : [list(map(int,input().split()) for _ in range(n))]

X=i2()
print(1 if X==0 else 0)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N= int(input())

if N == 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

x = int(readline())

print(1 if x == 0 else 0)

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
#sys.exit()
#sorted( ,reverse=True)
x = int(input())
#S,T = map(int, input().split())
#A = list(map(int, input().split()))
#A = [int(input()) for _ in range(N)]

#cnt = 0
#cnt += 1
if x==0:
    print(1)
else:
    print(0)


#print(N)
#print(S,T)
#print(A)
#print('Yes')
#print('No')
#print(cnt)

Submission status: Accepted

Solution code:
# 2020/09/13
# AtCoder Beginner Contest 178 -A

# Input
n = int(input())

# Calc
if n == 0:
    ans = 1
else:
    ans = 0

# Output
print(ans)

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

Submission status: Accepted

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

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==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:
from sys import stdin
import math
inp = lambda : stdin.readline().strip()

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

Submission status: Accepted

Solution code:
x = input()
print("0") if x == "1" 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):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:
from sys import stdin
def ip(): return [int(i) for i in stdin.readline().split()]
def sp(): return [str(i) for i in stdin.readline().split()]


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

Submission status: Accepted

Solution code:
def li():
    return [int(x) for x in input().split()]


x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


def main():
    N = int(sys.stdin.readline().rstrip())

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


main()

Submission status: Accepted

Solution code:
import sys
from io import StringIO
import unittest
import os

# 再帰処理上限(dfs作成時に設定するのが面倒なので限度近い値を組み込む)
sys.setrecursionlimit(999999999)


# 実装を行う関数
def resolve(test=""):
    try:
        n = int(input())

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


    except IndexError as err:
        print("インデックスエラー:", err.args[0])


# テストクラス
class TestClass(unittest.TestCase):
    def assertIO(self, assert_input, output):
        stdout, sat_in = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(assert_input)
        resolve(sys._getframe().f_back.f_code.co_name)
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, sat_in
        self.assertEqual(out, output)

    def test_input_1(self):
        test_input = """1"""
        output = """0"""
        self.assertIO(test_input, output)

    def test_input_2(self):
        test_input = """0"""
        output = """1"""
        self.assertIO(test_input, output)

    # 自作テストパターン
    def test_original(self):
        pass


# youk_debug_library
def list_to_tsv(target: [], limit_row: int = 0, limit_column: int = 0) -> str:
    # 行列を制限の範囲内に絞り込む
    if limit_row is not 0:
        target = target[:limit_row]
    if limit_column is not 0:
        target = [i[:limit_column] for i in target]

    # 行番号、列番号を追加
    target = [[cnt] + i for cnt, i in enumerate(target)]  # 行番号
    target.insert(0, [i for i in range(len(target[0]))])  # 列番号
    # tsv形式で出力
    result = ""
    for a in target:
        result += '\t'.join(map(str, a)) + '\r\n'
    return result


# 実装orテストの呼び出し処理
if __name__ == "__main__":
    if os.environ.get("USERNAME") is None:
        # AtCoder提出時の場合
        resolve()

    else:
        # 自PCの場合
        unittest.main(verbosity=2)

Submission status: Accepted

Solution code:
# coding=utf-8
from math import floor, ceil, sqrt, factorial, log, gcd
from itertools import accumulate, permutations, combinations, product, combinations_with_replacement
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from heapq import heappop, heappush, heappushpop, heapify
import copy
import sys
INF = float('inf')
mod = 10**9+7
sys.setrecursionlimit(10 ** 6)


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

# 1 2 3
# a, b, c = LI()


def LI(): return list(map(int, sys.stdin.buffer.readline().split()))

# a = I()


def I(): return int(sys.stdin.buffer.readline())

# abc def
# a, b = LS()


def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()

# a = S()


def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')

# 2
# 1
# 2
# [1, 2]


def IR(n): return [I() for i in range(n)]

# 2
# 1 2 3
# 4 5 6
# [[1,2,3], [4,5,6]]


def LIR(n): return [LI() for i in range(n)]

# 2
# abc
# def
# [abc, def]


def SR(n): return [S() for i in range(n)]

# 2
# abc def
# ghi jkl
# [[abc,def], [ghi,jkl]]


def LSR(n): return [LS() for i in range(n)]

# 2
# abcd
# efgh
# [[a,b,c,d], [e,f,g,h]]


def SRL(n): return [list(S()) for i in range(n)]


def main():
    a = I()
    if a == 0:
        print(1)
    elif a == 1:
        print(0)


if __name__ == "__main__":
    main()

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:
print(int(input()) ^ 1);

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import time
startTimeProblem=time.time()

import fileinput, sys, itertools, functools
from math import *
from bisect import *
from heapq import *
from collections import *

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

class InputHelper:
    def __init__(self):
        self.myinput = fileinput.input()

    def isLocal(self):
        return not fileinput.isstdin()

    def int(self):
        return int(self.myinput.readline().rstrip())

    def ints(self):
        return [int(_) for _ in self.myinput.readline().rstrip().split()]

    def str(self):
        return self.myinput.readline().rstrip()

    def strs(self):
        return [_ for _ in self.myinput.readline().rstrip().split()]

class OutputHelper:
    def int(self, a):
        print(a)    

    def ints(self, a):  
        print(" ".join([str(_) for _ in a]))
    
    def intsNL(self, a):
        for _ in a:
            print(_)
    
    def str(self, s):
        print(s)

    def strs(self, s):
        print(" ".join([_ for _ in s]))

    def strsNL(self, s):
        for st in s:
            print(st)

class ListNode:
    def __init__(self, val):
        self.val = val
        self.next = None
        self.prev = None

In = InputHelper()
Out = OutputHelper()

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

x = In.int()

if x==0:
    Out.int(1)
else:
    Out.int(0)

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

if len(sys.argv)>2 and sys.argv[2]=="TIMEIT":
    fin = (time.time()-startTimeProblem)*1000
    print("{:.2f}".format(fin) + "ms")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
def get_array(): return list(map(int, sys.stdin.readline().strip().split()))
def get_ints(): return map(int, sys.stdin.readline().strip().split())
def input(): return sys.stdin.readline().strip()
x=int(input())
if x==0:
    print(1)
elif x==1:
    print(0)

Submission status: Accepted

Solution code:
x = int(input())

answer = [1,0]

print(answer[x])

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 if N == 0 else 0)

Submission status: Accepted

Solution code:
x = int(input())

print(1 - x)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-
#
# FileName: 	A
# CreatedDate:  2020-09-13 20:49:12 +0900
# LastModified: 2020-09-13 21:00:44 +0900
#


import os
import sys
# import numpy as np
# import pandas as pd


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    a = int(input())

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

Submission status: Accepted

Solution code:
x = int(input())

print((1-x))

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
def main():
    s = int(input())
    if s == 0:
        print(1)
    else:
        print(0)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import os
import heapq
import sys,threading
import math
import bisect
import operator
from collections import defaultdict
sys.setrecursionlimit(10**5)
from io import BytesIO, IOBase
def gcd(a,b):
    if b==0:

        return a
    else:
        return gcd(b,a%b)
def power(x, p,m):
    res = 1
    while p:
        if p & 1:
            res = (res * x) % m
        x = (x * x) % m
        p >>= 1
    return res
def inar():
    return [int(k) for k in input().split()]

def lcm(num1,num2):
    return (num1*num2)//gcd(num1,num2)

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


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

if __name__ == "__main__":
    main()
    #threadin.Thread(target=main).start()

Submission status: Accepted

Solution code:
n=int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

Solution code:
x = int(input())

ans = 1-x
print(ans)

Submission status: Accepted

Solution code:
X, = [int(x) for x in input().split()]
if X == 0:
    print(1)
elif X == 1:
    print(0)

Submission status: Accepted

Solution code:
N=int(input())

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

Submission status: Accepted

Solution code:
n = int(input())
# n, k = list(map(int, input().split()))
# Ch, Cw = list(map(int, input().split()))
# Dh, Dw = list(map(int, input().split()))
# data = [list(map(int, input().split())) for i in range(4)]
# k = int(input())
# a = list(map(int, input().split("/")))
# r = list(map(int, input().split()))
# ab_sorted = sorted(ab, key=lambda x: x[0])
# data = [list(map(int, input().split())) for i in range(n)]
# month = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]

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

Submission status: Accepted

Solution code:
# import itertools
# import math
# import fractions
# import functools
# import copy
# from collections import deque
# from functools import reduce
# from decimal import Decimal


def main():
    n = int(input())
# a, b = map(int, input().split())
# l = list(map(int, input().split()))
# s = input()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
## for use in beginner level questions where speed is key
## and also for single test case code
## mastercopy for x,y,z

import sys
import heapq, functools, collections
import random
from collections import Counter, defaultdict

# read line as a string
# strr = input()

# read line as an integer
k = int(input())

# read one line and parse each word as a string
# lst = input().split()

# read one line and parse each word as an integer
# arr = list(map(int,input().split()))

print(1-k)

Submission status: Accepted

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

Submission status: Accepted

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

input = sys.stdin.readline


def ST():
    return input().rstrip()


def I():
    return int(input())


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


def LI():
    return list(MI())


x = I()
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:
import math
from collections import defaultdict
ml=lambda:map(int,input().split())
ll=lambda:list(map(int,input().split()))
ii=lambda:int(input())
ip=lambda:input()

"""========main code==============="""

#t=ii()
t=1
for _ in range(t):
    x=ii()
    if(x==0):
        print(1)
    else:
        print(0)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve(x):
    return 1 - x


def main():
    x = int(input())
    res = solve(x)
    print(res)


def test():
    assert solve(1) == 0
    assert solve(0) == 1
    

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

Submission status: Accepted

Solution code:
def MI():
    return map(int, input().split())

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

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

Submission status: Accepted

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

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


stdin = sys.stdin
def ns(): return stdin.readline().rstrip()
def ni(): return int(stdin.readline().rstrip())
def nm(): return map(int, stdin.readline().split())
def nl(): return list(map(int, stdin.readline().split()))


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

Solution code:
x = int(input())
#a = list(map(int, input().split()))
#d, t, s = map(int, input().split())

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

Submission status: Accepted

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