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:
def ri():
    return int(input())


def rii():
    return [int(v) for v in input().split()]


def solve(x):
    return 0 if x else 1


if __name__ == "__main__":
    print(solve(ri()))

Submission status: Accepted

Solution code:
x = float(input())
if float(x) == 0:
  print(1)
elif float(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:
import sys
print('10'[int(sys.stdin.buffer.readline())])

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
print('10'[int(input())])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print 1-input()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
FAST_IO = 0
if FAST_IO:
    import io, sys, atexit
    rr = iter(sys.stdin.read().splitlines()).next
    sys.stdout = _OUTPUT_BUFFER = io.BytesIO()

    @atexit.register
    def write():
        sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())
else:
    rr = raw_input
rri = lambda: int(rr())
rrm = lambda: map(int, rr().split())
rrmm = lambda n: [rrm() for _ in xrange(n)]

####
MOD = 10**9 + 7
YES, NO, IMP = "YES", "NO", "IMPOSSIBLE"
from collections import defaultdict as ddic


n = rri()
print 1-n

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = int(input())

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

Submission status: Accepted

Solution code:
#解説配信メモ
x=int(input())
print(x^1)#XOR演算

Submission status: Accepted

Solution code:
N, = map(int, input().split())
print(1-N)

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
print input()^1

Submission status: Accepted

Solution code:
# This code is generated by [Atcoder_base64](https://github.com/kyomukyomupurin/AtCoder_base64)
# Original source code : 

"""
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>

using namespace std;

using int64 = long long;

#define all($) begin($), end($)
#define rall($) rbegin($), rend($)

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);

  int x; cin >> x;
  cout << !x << endl;

  return 0;
}

"""

import base64
import subprocess
import zlib


exe_bin = "c%0=~eQaA-6~F#S;(R%7)~-och}ET{*_yYwO|xXB%ueF=8Im+h+|t3)JI8jC#~eHId+wYHQA^n-d0j?URZ}$tngmP*@kfym0*Q%K87)ZD)D9t#7-E|ka;8no80!jSG55ZA&+~iN@3ArQA2*86J->U-x%Zy?ecqYy$YH0$fgrii7ZBwN^%@^!_{H0F5rXxjdh+`jv=h}5-ffWM=}m{3dh~iUy?&?0^K>UNQ-^`pAp4YWGE;>7x*l!oT(gGGHTzBUBCEHp#;oULdIhFeVDdl_(*p|qbF=>_!+AQ4%+$^3_!~-s=C?L#JWuWP?jw4&=#wWOqZ6z?JHK3D?F9<sa92v2?(4lPmFP}M>0G`$-{05W*DJ^wVV~M2ACo;Yc1)G0;|;D-`^PX^{?cnZzcqd}fA!s0yx+ULy|?u99WScYc~NEDh()J^XnL8Atrwbx<frSvWL5ed`ERwrL&V@N3w+T=K5c{dI;`>AZSW6l>>RVfI}pr3a~ij?@3WCVXoEj*Q*R5gzXi3Spik5Cu>t=H((nhjXm}e;1Tqg~B@w^#PCE8|2;<rLOd88dEURFQa3ng46Ul6HR+5!uHaa?#%A}Lg*mNqXm06d3Wo$AtfJd>EmXlc}G93<2OlG23Es(NuctRrCNu@WLPNX97NhJ`7&&9G>$;Ko_j>M_B64*Z-lchM$$VxUDn~y|sv<HVL`>?9IKQ5(Jb4tIIkuecX_D0f@G8_n>;_$!$c`+Tw4@=4%=~qI^gr}`Ehcr#ns(2=+P`|{%CBz%?hj4uEAv_b4QUr+SV>qTH^OC}t87Uo0NvBEIF;!&#n~#x39vO)Y4&i-5ub$f{9MJM7PT>7QuP|Wb5M5_3@=t%=<d<$}E_JA!>YtVzB-ifH=1mXz-zrJXbY)I6EVo0dr+O(zMc#ob`$q9hmy_<qc_y!Po%7Hd9%J&bf53iNXwc{ahmW&!CePtPChzf?ap14DXtWkp_7$4`V8H7Q_^SrI!GM<xc%uQ|FyKuF{H6hKHsG*csJFca9M%iPTMYOGW~UBS_EeglHQ+7-e$jxt4frJkZaf!%X26Z-!m0tUGvL2A;2r}mF1_Uu&(=I&=SSkBtBSLHO<a1xv!<7q4-Ar`^6p{s+tLvvIm*w`qV-qHB<;S3^0bTV*HnHV<>`>Eud4hVl&4)?zohcJC{Me%{;bOHpgir``ijc8Ql55cy`b_9gr8Y4w6`r#PKamSyZ2DGINa$8td^2QQe0L#-Qw~g$wT^bwdQcW*5i^y%FYgVx&t>z;a+0x(bZtf`75QTs7~=}X@JtR(N0f7+`m<|nyU+}5;wH1l}1TfO9z?}S~?!l>R&#zix{SED+N`>Lr>KbetFw7Dmma*OJDG;J4xxxO5p8C@%l-z_`10CmyPl0$a2ls9Mnqldz!Jmw2#~Ri0<E8I)+u~e!?6Rmuv2$1_y46#W$38GDHov+7LBQm0zv2XKIa(im83=T0>e@GhLfRU%b5O5{nz+<<h;P<BE8FQ)wdxuh(b>o2WrMdxb**;!c#iOI$j1hA0q|q&-cf+dm{+X=<}vE{UWIS8D2soP(+tsNQ>PGiraR_|*Cg^@YlZz8pFpDgHimEJS><`-)TTYWGWoPKJsfMT$2@y53Od<mHcCCHxU_@S|@l{=grhJtM_`judYU7vBk$x4t4StvSSjKjq$}4*%*@=z-8w=wt}5tyJ3o-Wr?ZY*wrL+-<IdLADn5k}94c^hbo!Gw>ILzDVfjX~zgn5&8h3Unf0qlaYIi&=H4rzoE%-dICA}KF4iMb)FSRosZ)5PU|6hcN*52wLC(dO#Z^Z%4OAYUf*GF+ZS6JANCZ`y*m!xvA=T{=+isl29Yza-!}43+gBpEOo3sq-zhbCJ)uUmEKhw#`Xtb@FL`|@y_z<)b)Nh$kai|1FzEGt(>dsEd(sv5`j_2<-aSv$h~A#ZYDI7VQr)OGnDzFDygecBo<Xml$PxKLVvC*)uh8}rJGPg#|APeQADnk^z8T*&M%vCYaQ67wpu(BsW`|Wf<Keu8XBwQ-I~axY72Z=YN8aBoXDEgHJ)9vycF4flvC7Kf>^#TX2WMs*quY=<!5LOy=L^h%i;Tj&hqGuqw71TTpQtsr+t2EUGal;yEHcY|Sl0UIV9+MxZ?cY-84vB+VEoIh{2z=rp1J?aq`xD%bewfyhS5`uKE~+Nj6TQcPmPQIQzW=o9T^(B$G_*;bS|yr{C5ingr4sGIh6~1BhWAO^mb|JC$Z@wUhlV9^z?QbwZvUWvBcf_{50b=`n)vbwfg)u<8}JDnsJXlAIx~YKJUzUgFZjac%!~f&3F?ETH?)U)e`rjYnFJ6zV6Mq5BV(dEqdI*jJKi_miR6DK4QkV>idTo-)1>~UFcSQy_<2ex_wr7<-KXf+p93T?A_?yGLO^lIEmk2e-#+sq3X1u#a6$r59L;N2AG{o^=AAa!#6m5jN!osGoE1e=DB)hHDB$|XPBJ=XXiOpzIt5j+W#w6z7;7=e2KOEZ`I%GdGc4)PWAY{qyFAfJs%tz&bRXx2Q8|e4_)fJaXa#H<38b}@rvqs(xb*DD)Stc_q{gpkhD#lhn|P6hV>;g{BavQFVlLR+x7hs(w}YQ-*QsCdYyh?BY)hfwFly@a3|d2w3ff1;??_1w^M5;@6Q3Jbv$R>srjGx^M_Q1$QN48_>@z_dHa%0JD+6zT4D1!$?)&k$X{_<$EjXtcHp7`+x_31*6}Eh%i8|uT-NscZ18a#J1B(5GKvsiSU~v5$kD;j2*z@58b`EX4UPYd^kXb#q_m`<cvg{>+{}y+N0lHLR_1Y>2D@a0aUz3fQ<>>l3MZ6IR>rYh9>p{B3#p`%ObB=P4fI<J(TI_RW7%wM5hv41b`i~FWAjOz$j#3$5)}i7X;Vz17$2SpjfQb}Y?#LA@R6}&I4m+y9G*aU`2MlbXk>_#nUoV|K#fxAemHvg@MJiOqoKi(FtM6U#FQAqk)vwRERAz=GV$?|wP4T~%Q6SYSQ(3eefj_(Uq?dD;JFyFlr#hwts0_*?6_ud(Y;D3)ryV|ftMjNSXDc56L=C&%QEDxBaFPZ8ZC^=IdxcU1E(e}Vc<W9Wh*x69MhwvmNi%6l)P7}!@#zoUW*W{xiTcki}OlsnouRH(K*OTX<~8#3F(ZI6hecMZY4I$xY=}0n9fP5M7NYcDmNFC=a7(COcQ$=RkB*isbp4`GHDZoNm(|Ticvw9TSzIiO5$po6=pLeLna0JRedF7GwQ4tl5=bY&Ly%HPE*wukEQ{6QbTNBij$10PNo48$Tl!f)~nSf^xr4?E~Hx|?4Neu+aNhO{&u9j#Xz6`p5^D{`RjLp(}#OL(9Vz1r}2mz<ShpJ{CBB642Nqxe|@I+v_?by@NNKFU>&B{eTP9G-j&CZ`5P9zFMyuo9LD?aB+}lRpbzg5pnk6X+-F7f5YpbRz{7h5=!2-zekZE#|7oQ86!hU;0~FrVy#Jv8k1+i~#>4vuD7@#X{;d}JPa@;Dyh=O+D7^b2@#A0Q^x-`Pw7|*xIC`Gbhj$lH-d`S$ew)*W`y<eO+&k1~X3=*!eYhV2<(?H){r>^ehdT+}gZcX~uMhOc$h`jTzAM|+|4U9E-j6{2+=S=-`5UBt7lC+C<vTO$2Pe<_pMKA6G3dklBj0RYAFux!(tNMSqxA3i3}79r<@BIk7m(I}KAu%zA9V^JQ~#TszJBland{;8A#E@W^!58ZQw(zRFUaY?&+6v`H=y6e;Z|`;tN3k@>2EN{(Q~F7Rj>bgL)(q1hb{aZSIF<5TWs{d&jOsA9M0?i8~glX9{"

open("./kyomu", 'wb').write(zlib.decompress(base64.b85decode(exe_bin)))
subprocess.run(["chmod +x ./kyomu"], shell=True)
subprocess.run(["./kyomu"], shell=True)

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 and x<1):
  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:
import math as mt
import sys, string
from collections import Counter, defaultdict
input = sys.stdin.readline

# input functions
I = lambda : int(input())
M = lambda : map(int, input().split())
ARR = lambda: list(map(int, input().split()))

n = I()
print(int(not n))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#import sys
#input = sys.stdin.readline
def main():
    print( int( input())^1)
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
import copy

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
t=int(input(''))
print(1-t)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
'''
Problem Link - https://atcoder.jp/contests/abc178/tasks/abc178_a
'''
from sys import stdin,stdout
from math import *
from collections import *

mod = 1000000007

def gcd(a,b):
	while b:
		a,b = b,a%b
	return a

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

def set_bits(X):
	c = 0
	while X:
		X &= (X-1);c += 1
	return c

def compute_MOD(N,M): return (N%M + M) % M

def get_array(): return list(map(int, stdin.readline().split()))
 
def get_ints(): return map(int, stdin.readline().split())

def get_int(): return int(stdin.readline())

def get_input(): return stdin.readline().strip()

def main():
	x = get_int()
	if x:stdout.write('0\n')
	else:stdout.write('1\n')

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n = int(input())

print(0 if n == 1 else 1)

Submission status: Accepted

Solution code:
import sys

input=sys.stdin.buffer.readline


#sys.setrecursionlimit(10**9)
#from functools import lru_cache

def RD(): return sys.stdin.read()


def II(): return int(input())


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


def MF(): return map(float,input().split())


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


def LF(): return list(map(float,input().split()))


def TI(): return tuple(map(int,input().split()))


# rstrip().decode('utf-8')


def main():
	print(1-II())
	

	

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

Submission status: Accepted

Solution code:
import sys
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
def resolve():
    print(1 - int(input()))
resolve()

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

Submission status: Accepted

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

Submission status: Accepted

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

    print(0 if x else 1)


if __name__  == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(+(input()<'1'))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

Solution code:
import sys
def I(): return int(sys.stdin.readline().rstrip())


print(1-I())

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

    print(1 if x == 0 else 0)


if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main():
    t = int(input())

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

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:
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

x = ii()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = input()

# そのまま
if x == '0': print(1)
else: print(0)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(int(bin(int(input()) ^ 1), 2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

import numpy as np
from functools import *
import sys
sys.setrecursionlimit(100000)
input = sys.stdin.readline


def array(size, init=0):
    return [[init for j in range(size[1])] for i in range(size[0])]


def acinput():
    return list(map(int, input().split(" ")))


def II():
    return int(input())


x = II()

print((x+1) % 2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ABC178 A
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:
import math

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


def b():
    pass



def c():
    pass



def d():
    pass


a()
# b()
# c()
# d()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
x = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

# def
def int_mtx(N):
    x = []
    for _ in range(N):
        x.append(list(map(int,input().split())))
    return np.array(x)

def str_mtx(N):
    x = []
    for _ in range(N):
        x.append(list(input()))
    return np.array(x)

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

def int_list():
    return list(map(int,input().split()))

def print_space(l):
    return print(" ".join([str(x) for x in l]))

# import
import numpy as np
import collections as col

x = int(input())

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

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



# 2darray [[0] * 4 for i in range(3)]
# import itertools

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

Solution code:
import os
import sys
from atexit import register
from io import BytesIO
sys.stdin = BytesIO(os.read(0, os.fstat(0).st_size))
sys.stdout = BytesIO()
register(lambda: os.write(1, sys.stdout.getvalue()))
input = lambda: sys.stdin.readline().rstrip('\r\n')
raw_input = lambda: sys.stdin.readline().rstrip('\r\n')

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

Submission status: Accepted

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

Submission status: Accepted

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


n = float(input())
r = f(n)
if r != None:
	print(r)

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

Solution code:
n = int(input())

print(abs(n-1))

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

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 python

def f(x: int) -> int:
    """
    >>> f(0)
    1
    >>> f(1)
    0
    """
    if x == 1:
        return 0
    else:
        return 1


if __name__ == '__main__':
    x = int(input())
    print(f(x))

Submission status: Accepted

Solution code:

if __name__ == "__main__":
    x = int(input())
    ret = 0
    if x == 1:
        ret = 0
    else:
        ret = 1
    print(ret)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin,stdout

n = int(stdin.readline())
if n==0:
  stdout.write(str(1)+"\n")
else:
  stdout.write(str(0)+"\n")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 
import sys

from sys import stdin
input = lambda: stdin.readline().rstrip()

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 == 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)%2)

Submission status: Accepted

Solution code:
a = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=input()

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from math import gcd
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor, gcd
from operator import mul
from functools import reduce


sys.setrecursionlimit(2147483647)
INF = 10 ** 13
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().rstrip().split()
def S(): return sys.stdin.readline().rstrip()
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]

mod=10**9+7


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())
if x == 0 :
  print(1)
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:
# -*- coding: utf-8 -*-
 
# n, m = map(int,input().split())

x = int(input())

print((x + 1) % 2)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

x = int(input())
print(int(not x))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def S(): return input().rstrip()
def LS(): return S().split()
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float("INF")

#solve
def solve():
    x = II()
    print(x^1)
    return


#main
if __name__ == '__main__':
    solve()

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

print(r)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
mod = 10**9 + 7
def C():
    N = int(input())
    ans = 10**N - 2*9**N + 8**N
    print(ans%mod)
def A():
    N = int(input())
    if( N == 0):
        print(1)
    else:
        print(0)
A()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

if x == 1:
    x=0
elif x==0 :
    x=1

print(x)

Submission status: Accepted

Solution code:
a = int(input())

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

Submission status: Accepted

Solution code:
def resolve():
    N = input()

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

resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

print(1^x)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int( input().strip() ) ; 

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if 1 == int(input()):
  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:
user = int(input())
if user >= 0 or user <= 1:
    if user == 1:
        print(0)
    elif(user==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:
#!/usr/bin/env python
import os
import sys
from io import BytesIO, IOBase

def ii():  return int(input())
def si():  return input()
def mi():  return map(int,input().strip().split(" "))
def li():  return list(mi())

def main():
    x = ii()

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


# region fastio

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

# endregion

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
s=int(input())

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

Submission status: Accepted

Solution code:

if __name__ == '__main__':
    x = [list(map(int, input().split())) for i in range(1)]

    try:
        x = int(x[0][0])
    except Exception as e:
        print('error')
        exit(1)

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