Problem:


Score : 100 points

Problem Statement

You will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above.

The current temperature of the room is X degrees Celsius. Will you turn on the air conditioner?

Constraints

-40 \leq X \leq 40

X is an integer.

Input

Input is given from Standard Input in the following format:

X

Output

Print Yes if you will turn on the air conditioner; print No otherwise.

Sample Input 1

25

Sample Output 1

No

Sample Input 2

30

Sample Output 2

Yes



Sample input:
25


Sample output:
No

Submission status: Accepted

Solution code:
s = int(input()) 

print("Yes" if s>=30 else "No")

Submission status: Accepted

Solution code:
from sys  import stdin,stdout

import bisect

import math

def st():
    return list(stdin.readline().strip())

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

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

def mp():
    return map(int,stdin.readline().split())

def pr(n):
    stdout.write(str(n)+"\n")

def soe(limit):
    l=[1]*(limit+1)
    l[0]=0
    l[1]=0
    prime=[2]
    for i in range(2,limit+1):
        if l[i]:
            for j in range(i*i,limit+1,i):
                l[j]=0
    
    for i in range(3,limit+1,2):
        if l[i]:
            prime.append(i)
    return prime

def segsoe(low,high):
    limit=int(high**0.5)+1
    prime=soe(limit)
    n=high-low+1
    l=[0]*(n+1)
    for i in range(len(prime)):
        lowlimit=(low//prime[i])*prime[i]
        if lowlimit<low:
            lowlimit+=prime[i]
        if lowlimit==prime[i]:
            lowlimit+=prime[i]
        for j in range(lowlimit,high+1,prime[i]):
            l[j-low]=1
    for i in range(low,high+1):
        if not l[i-low]:
            if i!=1:
                print(i)
                
def gcd(a,b):
    while b:
        a=a%b
        b,a=a,b
    return a

def power(a,n):
    r=1
    while n:
        if n&1:
            r=(r*a)
        a*=a
        n=n>>1
    return r


def solve():
    n=inp()
    if n>=30:
        print("Yes")
    else:
        print("No")
    


for _ in range(1):
    solve()

Submission status: Accepted

Solution code:
N = int(input())
if N >= 30:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    X = I()

    if X >= 30:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
n = int(input())
if(n>=30):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    print('Yes' if N >= 30 else 'No')

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
print(["No", "Yes"][int(input()) >= 30])

Submission status: Accepted

Solution code:
X = int(input())
if 30 <= X :
    print('Yes')
else :
    print('No')

Submission status: Accepted

Solution code:
x = int(input())

if x >= 30:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

YES = "Yes"  # type: str
NO = "No"  # type: str


def solve(X: int):
    if X>=30:
        print(YES)
    else:
        print(NO)
    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:
def readinput():
    n=int(input())
    return n

def main(n):
    if n>=30:
        return 'Yes'
    else:
        return 'No'
    ans=0
    return ans

if __name__=='__main__':
    n=readinput()
    ans=main(n)
    print(ans)

Submission status: Accepted

Solution code:
x = int(input())
# a = map(int,input().split())
if x >= 30:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a = int(input())

if a>=30:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline

def main():
    ans = 0
    x = int(input())
    if x >= 30:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def main():
    n = int(input())
    if n >= 30:
        print('Yes')
    else:
        print('No')

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
#!/usr/local/bin/python3
# coding: utf-8
import numpy as np

kita = int(input())

if kita >=30:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
n = int(input())

if 30 <= n:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

# from math import gcd
from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations, combinations_with_replacement

N = int(input())

if N >= 30:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
#ceilevenoddformula
import math
from queue import PriorityQueue
import bisect
import copy
import time
from collections import Counter
#map(int,input().split())
#int(x) for x in input().split()
n=int(input())
if n>=30:
	print('Yes')
else:
	print('No')

Submission status: Accepted

Solution code:
x = int(input())

if x >= 30:
  print("Yes")
else :
  print("No")

Submission status: Accepted

Solution code:
x = int(input())

if x < 30:
    print('No')
else:
    print("Yes")

Submission status: Accepted

Solution code:
import random


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


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


n = int(input())
#a = list(map(int, input().split()))
#= map(int, input().split())
if n>=30:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a=int(input())
if a>=30:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
def solve():
    X = int(input())
    if X >= 30:
        print('Yes')
    else:
        print('No')

if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
if __name__ == '__main__':

	n = int(input())

	if n >= 30:
		print("Yes")
	else:
		print("No")

Submission status: Accepted

Solution code:
def solve():
    x = int(input())
    if x >= 30:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
n = int(input())

if n >= 30 :
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys

def I(): return int(sys.stdin.readline().rstrip())
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())

X = I()

if X >= 30:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
x = int(input())
if x >= 30:
    print('Yes')
else :
    print('No')

Submission status: Accepted

Solution code:
def main():
    X = int(input())
    if X <= 29:
        print('No')
    elif X >= 30:
        print('Yes')
    
main()

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    if N >= 30:
        print('Yes')
    else:
        print('No')
    


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys,math
from collections import deque,defaultdict
import operator as op
from functools import reduce

I=sys.stdin.readline

def ii():
	return int(I().strip())
def li():
	return list(map(int,I().strip().split()))
def mi():
	return map(int,I().strip().split())
def ncr(n, r):
    r = min(r, n-r)
    numer = reduce(op.mul, range(n, n-r, -1), 1)
    denom = reduce(op.mul, range(1, r+1), 1)
    return numer // denom


def main():
	n=ii()
	if n>=30:
		print("Yes")
	else:
		print("No")





		










		


		










		






if __name__ == '__main__':
	main()

Submission status: Accepted

Solution code:
x = int(input())
if(x<30):
  print('No')
else:
  print('Yes')

Submission status: Accepted

Solution code:
x = int(input())

if x >= 30: print("Yes")
else: print("No")

Submission status: Accepted

Solution code:
n= int(input())
if n>=30:
	print('Yes')
else:
	print('No')

Submission status: Accepted

Solution code:
n=int(input())

if( n>=30 ):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
print('Yes')if(int(input())>=30) else print('No')

Submission status: Accepted

Solution code:
X = int(input().rstrip())
if X >= 30 :
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
def resolve():
    n = int(input())
    if n >= 30:
        print('Yes')
    else:
        print('No')

resolve()

Submission status: Accepted

Solution code:
x = int(input())

if x >= 30:
    print("Yes")

else:
    print("No")

Submission status: Accepted

Solution code:
def main():
    X = int(input())
    if X >= 30:
        print('Yes')
    else:
        print('No')
    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a = int(input())

if (a >= 30):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a=int(input())
#l=list(map(int,input().split()))
if a>=30:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
import math

#import sympy

#n=map(int,input().split())

a=int(input())
if a>=30:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
i = int(input())

if i >= 30:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
x=int(input())

if(x>=30):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
x = int(input())

if (x>=30):
    print("Yes")
else :
    print("No")

Submission status: Accepted

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

def main():
    X = int(input())
    if X >= 30:
        ans = 'Yes'
    else:
        ans = 'No'
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a = int(input())

if a < 30:
  print('No')
else:
  print('Yes')

Submission status: Accepted

Solution code:
#!python3.8
# -*- coding: utf-8 -*-
# abc174/abc174_a
import sys

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

def main():
    X = i2n()
    print('Yes' if X >= 30 else 'No')
    return

main()

Submission status: Accepted

Solution code:
X = int(input())

if X >= 30:
  print('Yes')
  
else:
  print('No')

Submission status: Accepted

Solution code:
import sys

def II(): return int(input())
def MI(): return map(int,input().split())
def LI(): return list(map(int,input().split()))
def TI(): return tuple(map(int,input().split()))
def RN(N): return [input().strip() for i in range(N)]


def main():
    N = II()
    if N >= 30:
        print("Yes")
    else:
        print("No")
    
    

if __name__ == "__main__":
	main()

Submission status: Accepted

Solution code:
n = int(input())
if n>29:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
a = int(input())
if a >= 30 :
  print("Yes")
else :
  print("No")

Submission status: Accepted

Solution code:
import numpy as np
import math
import scipy as sp
import queue
import collections

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

def main(kwargs):
    x = kwargs["x"]
    res = "No"
    if x >= 30:
        res = "Yes"
    return res

if __name__ == "__main__":
    kwargs = {}

    cin = input().split()
    kwargs["x"] = [int(i) for i in cin][0]

    cout = main(kwargs)
    print(cout)

Submission status: Accepted

Solution code:
X = int(input())
print("Yes" if X>=30 else 'No')

Submission status: Accepted

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

def main():
    input = sys.stdin.readline
    x = int(input())
    if x >= 30:
        print("Yes")
    else:
        print("No")



if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = int(input())
if n>= 30:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
X = int(input())
ans = "No"
if X >= 30:
    ans = "Yes"
print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
x = int(input())
print('Yes' if x >= 30 else 'No')

Submission status: Accepted

Solution code:
n=int(input())
if n<30:
  print('No')
else:
  print('Yes')

Submission status: Accepted

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

X = int(input())

if X >= 30:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
x = int(input())

if x >= 30:
    ans = "Yes"
else:
    ans = "No"

print(ans)

Submission status: Accepted

Solution code:
import sys

X = int(input())

if X >= 30:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
x = int(input())

if x<30:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
#from collections import deque,defaultdict
printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split())
ins = lambda : input().strip()
DBG = True # and False
BIG = 10**18
R = 10**9 + 7
#R = 998244353

def ddprint(x):
  if DBG:
    print(x)

x = inn()
print('Yes' if x>=30 else 'No')

Submission status: Accepted

Solution code:
a = int(input())


if a >= 30:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
if int(input())>=30:print('Yes')
else:print('No')

Submission status: Accepted

Solution code:
n = int(input())

if n>= 30:
    print("Yes")
    
else:
    print("No")

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    x = int(input())
    if x >= 30:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:

x = int(input())

if 30 <= x :
    ans = 'Yes'
else :
    ans = 'No'

print(ans)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
# 幅優先探索（行きがけ）
import collections
import sys
import copy
import re
import math


def I(): return int(sys.stdin.readline().rstrip())
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())


def main():
    N = I()
    if 30 <= N:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
X = int(input())
if X>=30:
    print('Yes')

else:
    print('No')

Submission status: Accepted

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


def main():
    x = int(input())
    if x >= 30:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:

def resolve():
    X=int(input())
    if X>=30:
        print('Yes')
    else:
        print('No')
resolve()

Submission status: Accepted

Solution code:
import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 19
MOD = 10 ** 9 + 7
EPS = 10 ** -10

N = INT()

if N >= 30:
    Yes()
else:
    No()

Submission status: Accepted

Solution code:
X = int(input())  

if X >=30:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys
import re
import math
import collections
import bisect
import itertools
import fractions
import functools
import copy
import heapq
import decimal
import statistics
import queue

# import numpy as np

sys.setrecursionlimit(10 ** 9)
INF = 10 ** 16
MOD = 10 ** 9 + 7
# MOD = 998244353

ni = lambda: int(sys.stdin.readline())
ns = lambda: map(int, sys.stdin.readline().split())
na = lambda: list(map(int, sys.stdin.readline().split()))
na1 = lambda: list(map(lambda x: int(x) - 1, sys.stdin.readline().split()))


# ===CODE===


def main():
    x = ni()
    print("Yes" if x >= 30 else "No")


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
### ----------------
### ここから
### ----------------

import sys
from io import StringIO
import unittest

def yn(b):
    print("Yes" if b==1 else "No")
    return

def resolve():
    readline=sys.stdin.readline

    #n,m,k=map(int, readline().rstrip().split())
    #arr=list(map(int, readline().rstrip().split()))
    n=int(readline())
    if n>=30:
        print("Yes")
    else:
        print("No")
    #ss=readline().rstrip()
    #yn(1)

    return

if 'doTest' not in globals():
    resolve()
    sys.exit()

### ----------------
### ここまで 
### ----------------

Submission status: Accepted

Solution code:
x = int(input())
if x>=30:
    print('Yes')
else:
    print("No")

Submission status: Accepted

Solution code:
X=int(input())

if X>=30:
    ans="Yes"
else:
    ans="No"
print(ans)

Submission status: Accepted

Solution code:
x = int(input())

if x >= 30 :
    print("Yes")
else :
    print("No")

Submission status: Accepted

Solution code:
N=int(input())
if N>=30:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a = int(input())
if a >= 30:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
X = int(input())

if(X >= 30):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
def main():
    X = int(input())
    if X >= 30:
        print("Yes")
    else:
        print("No")

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:

X = int(input())
if X >= 30:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
N = int(input())
ans = "No"
if N >= 30: ans = "Yes"
print(ans)

Submission status: Accepted

Solution code:
x =int(input())

if x >= 30:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

input = sys.stdin.readline


def Y():
    print("Yes")


def N():
    print("No")


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


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


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


x = I()
if x >= 30:
    Y()
else:
    N()

Submission status: Accepted

Solution code:
a=int(input())
if a>= 30:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
def main():
    k = int(input())
    if k >= 30:
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
x = int(input())

if x >= 30:
  print('Yes')
  
else:
  print('No')

Submission status: Accepted

Solution code:
t = int(input())
print("Yes" if t >= 30 else "No")

Submission status: Accepted

Solution code:
from sys import stdin

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

    if 30 <= n:
        print("Yes")
    else:
        print("No")

if __name__ == "__main__":
    main()

Submission status: Accepted

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

n = int(input())
if n>=30:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**6)


def main(input, print):
    X = int(input())
    if X >= 30:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main(sys.stdin.readline, print)

Submission status: Accepted

Solution code:
#https://atcoder.jp/contests/agc008/submissions/15248942
import sys
 
sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))

X = ini()
if X >= 30:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
t=int(input())
if t<30:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]

n = int(input())
if (n>=30):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
N=int(input())
if N>=30:
	print("Yes")
else:
	print("No")

Submission status: Accepted

Solution code:
# 整数の入力
N = int(input())

if N >= 30:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import product, combinations,permutations
from copy import deepcopy
import sys
sys.setrecursionlimit(4100000)



if __name__ == '__main__':
    X  = int(input())
    if X>=30:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
n = int(input())
if n>=30:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
X = int(input())
if X >=30 :
    print("Yes")
else:
    print('No')

Submission status: Accepted

Solution code:
#!/usr/bin/env python
import os
import re
import sys
from bisect import bisect, bisect_left, insort, insort_left
from collections import Counter, defaultdict, deque
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from io import BytesIO, IOBase
from itertools import (
    accumulate, combinations, combinations_with_replacement, groupby,
    permutations, product)
from math import (
    acos, asin, atan, ceil, cos, degrees, factorial, hypot, log2, pi, radians,
    sin, sqrt, tan)
from operator import itemgetter, mul
from string import ascii_lowercase, ascii_uppercase, digits


def inp():
    return(int(input()))


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


def instr():
    s = input()
    return(list(s[:len(s)]))


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

# For getting input from input.txt file
#sys.stdin = open('input.txt', 'r')

# Printing the Output to output.txt file
#sys.stdout = open('output.txt', 'w')


def main():
    t = inp()
    print("Yes" if t >= 30 else "No")


# 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)
def input(): return sys.stdin.readline().rstrip("\r\n")

# endregion


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# print('input >>')
X = int(input())

if X >= 30:
    print('Yes')
else:
    print('No')

# print('-----output-----')

Submission status: Accepted

Solution code:

X=int(input())

if(X>=30):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
X = int(input())

print('Yes' if X >= 30 else 'No')

Submission status: Accepted

Solution code:
x = int(input())

if x >= 30:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
def main():
    x=int(input())
    if x >= 30: print('Yes')
    else: print('No')
    return

if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
n=int(input())

if n>=30:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
x = int(input())

if x<30:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
x = int(input())
if x >= 30:
    print('Yes')
else:
    print("No")

Submission status: Accepted

Solution code:
a = int(input())

if a >= 30:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
x=int(input())
print("Yes" if x>=30 else "No")

Submission status: Accepted

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


def main():
    s=int(input())
    if s >= 30:
        print("Yes")
    else:
        print("No") 


    
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
from sys import stdin

def main():

    input = stdin.readline

    N = int(input())

    if N >= 30:
        print("Yes")
    else:
        print("No")

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
from sys import exit
X = int(input())

if X >= 30:
    print('Yes')
    exit()

print('No')

Submission status: Accepted

Solution code:


X, = [int(x) for x in input().split()]
if X >= 30:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    #H , W, K = map(int, input().split())
    #A_list = list(map(int, input().split()))

    if N >= 30 :
        print("Yes")
    else :
        print("No")

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
X = int(input())
print("Yes") if X>=30 else print("No")