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:
import sys
print('Yes' if int(sys.stdin.readline().rstrip()) >= 30 else 'No')

Submission status: Accepted

Solution code:
print(int(input())>=30 and "Yes" or "No")

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("Yes" if int(input()) >= 30 else "No")
resolve()

Submission status: Accepted

Solution code:
import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush
from math import *
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations as perm
from bisect import bisect_left as bl, bisect_right as br, bisect
from time import perf_counter
from fractions import Fraction
# import numpy as np


mod = int(pow(10, 9) + 7)
mod2 = 998244353
def data(): return sys.stdin.readline().strip()
def out(*var, end="\n"): sys.stdout.write(' '.join(map(str, var))+end)
def L(): return list(sp())
def sl(): return list(ssp())
def sp(): return map(int, data().split())
def ssp(): return map(str, data().split())
def l1d(n, val=0): return [val for i in range(n)]
def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]

try:
    # sys.setrecursionlimit(int(pow(10,6)))
    sys.stdin = open("input.txt", "r")
    sys.stdout = open("../output.txt", "w")
except:
    pass


# @lru_cache(None)

X=L()[0]
if X>=30:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=int(input())
print(a<30 and 'No' or 'Yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())
if -40 <= x <= 40:
    [print("Yes") if x >= 30 else print("No")]

Submission status: Accepted

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

Submission status: Accepted

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

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>29:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import ceil,sqrt,log,gcd
def ii():return int(input())
def si():return input()
def mi():return map(int,input().split())
def li():return list(mi())
mod=1000000007

x=ii()
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:
t=int(input())
if(t>=30):
  print("Yes")
else:
  print("No")

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 >= 30:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

main()

Submission status: Accepted

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

Submission status: Accepted

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

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

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

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 main():
    x = int(input().strip())
    if x>=30:
        print("Yes")
    else:
        print("No")

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())
if 30<=X<=40:
    print('Yes')
elif -40<=X<30:
    print('No')
else:
    print('エラー')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if int(input())<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:
temp=int(input())
if temp>=30:
  print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
t = int(input())

if 30 <= t <=40 :
	print("Yes")
if -40 <= t < 30 :
	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())
print("Yes" if n>=30 else "No")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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


N = int(input())
main(N)

Submission status: Accepted

Solution code:
X = input()


if int(X) < 30:
  print('No')
else:
  print('Yes')

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:
import sys
import math
from collections import defaultdict
from bisect import bisect_left, bisect_right

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def LI(): return list(map(int, input().split()))
def LIR(row,col):
    if row <= 0:
        return [[] for _ in range(col)]
    elif col == 1:
        return [I() for _ in range(row)]
    else:
        read_all = [LI() for _ in range(row)]
        return map(list, zip(*read_all))

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

X = I()

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

Submission status: Accepted

Solution code:
from sys import stdin
import numpy as np
import sys
import math
n=int(input())
wk = 30
if n >= wk:
  print("Yes")
  sys.exit()
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:
from sys import stdin

X = int(stdin.readline().rstrip())
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:
x = (int)(input())

ret = "No"
if x >= 30:
    ret = "Yes"

print("{}".format(ret))

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

print('Yes' if int(read()) >= 30 else 'No')

Submission status: Accepted

Solution code:
if 30<=int(input()):
    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:
t = int(input())
if t>=30:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
def read():
    X = int(input())
    return X

def fun(X):
    if X >= 30:
        return 'Yes'
    else:
        return 'No'


if __name__ == '__main__':
    X = read()
    print(fun(X))

Submission status: Accepted

Solution code:
x = int(input());
if x >= 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:
#import sys
#import numpy as np
import math
#from fractions import Fraction
import itertools
from collections import deque
from collections import Counter
import heapq
from fractions  import gcd
#input=sys.stdin.readline
#import bisect
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:
print('NYoe s'[int(input())>=30::2])

Submission status: Accepted

Solution code:
import sys
import  math
import fractions
from collections import defaultdict
stdin = sys.stdin
     
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))


X=int(input())
print('Yes' if 30<=X else '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:
# Q1
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:
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:
# -*- coding: utf-8 -*-
"""
Created on Sun Aug  2 20:59:10 2020

@author: naoki
"""

X = int(input()) #temperature 

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!


temp = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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 30 <= x:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(1 << 25)
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(read())


def ints(): return list(map(int, read().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, read().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, read().split())))
    return ret


def read_matrix(H):
    '''H is number of rows'''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().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('Yes' if int(input()) >= 30 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
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()

def main():
	x=II()
	print("Yes" if x>=30 else "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:
val = int(input())
if val>=30:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
T=int(input())

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

Submission status: Accepted

Solution code:
M=int(input())


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

Submission status: Accepted

Solution code:
def main():
    x = int(input())
    if x<30:
        print("No")
    else:
        print("Yes")
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:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
x = int(input())

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

Submission status: Accepted

Solution code:

x = int(input())
#print(x)

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:
temp = int(input())
if temp < 30:
  print('No')
elif temp >= 30:
  print('Yes')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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


def solve():
    X = int(rl())
    if 30 <= X:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
X=int(input())

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

print("No")

Submission status: Accepted

Solution code:
x=input()
X=int(x)
if(X>=30 and X<=40):
  print('Yes')
elif(X>=-40 and X<30):
  print('No')

Submission status: Accepted

Solution code:
def resolve():
    X = int(input())
    if X >= 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:
if(int(input())) >= 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())
print("Yes") if A>=30 else print("No")

Submission status: Accepted

Solution code:
import numpy as np
import scipy.sparse as sps
import scipy.misc as spm
import collections as col
import functools as func
import itertools as ite
import fractions as frac
import math as ma
import cmath as cma
import copy as cp
import sys
def sinput(): return sys.stdin.readline().strip()
def iinput(): return int(sinput())
def imap(): return map(int, sinput().split())
def fmap(): return map(float, sinput().split())
def iarr(n=0):
    if n: return [0 for _ in range(n)]
    else: return list(imap())
def farr(): return list(fmap())
def sarr(n=0):
    if n: return ["" for _ in range(n)]
    else: return sinput().split()
def adj(n): return [[] for _ in range(n)]
sys.setrecursionlimit(10**7)
MOD = 10**9 + 7; EPS = sys.float_info.epsilon
PI = np.pi; EXP = np.e; INF = np.inf

x = iinput()
flag = x>=30
ans = "Yes" if flag else "No"
print(ans)

Submission status: Accepted

Solution code:
X = int(input())

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

Submission status: Accepted

Solution code:
tmp=int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

resolve()

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**8)
def ii(): 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 li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): return [[ini]*i for i2 in range(j)]
#import bisect #bisect.bisect_left(B, a)
#from collections import defaultdict #d = defaultdict(int) d[key] += value
#from collections import Counter # a = Counter(A).most_common()
#from itertools import accumulate #list(accumulate(A))

X = ii()

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

Submission status: Accepted

Solution code:
temperature = int(input())

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
temp = int(input())
print('Yes' if temp >= 30 else '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().strip() ) ;
print ( "No" if X < 30 else "Yes" ) ;

Submission status: Accepted

Solution code:
print("YNeos"[(int(input()) < 30)::2])

Submission status: Accepted

Solution code:
from sys import stdin,stdout
X = int(stdin.readline().strip())
if X<30:
	print("No")
else:
	print("Yes")

Submission status: Accepted

Solution code:
temparature = int(input())

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

Submission status: Accepted

Solution code:
LI = lambda: list(map(int, input().split()))

X = int(input())


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


if __name__ == "__main__":
    main()

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 >= 30:
    ans = "Yes"
else:
    ans = "No"

print(ans)

Submission status: Accepted

Solution code:
import numpy as np
a= float(input())
count = 0


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

Solution code:
if 30 <= int(input()):
    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:
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 python3
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:
T=int(input())
if T>= 30:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
# Code for A - Air Conditioner
# Use input() to fetch data from STDIN

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

Submission status: Accepted

Solution code:
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right 
import sys,math,itertools,fractions
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

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

Submission status: Accepted

Solution code:
T = int(input())

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

Submission status: Accepted

Solution code:
temp= int(input())

if temp >= 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:
x = int(input())
if x>= 30:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# 整数の入力
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:
s = int(input())
if s<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:
x = int(input())
if x < 30:
  print("No")
else:
  print("Yes")

Submission status: Accepted

Solution code:
def A(x):
    d = "Yes"
    f = "No"
    if x<30:
        return f
    else:
        return d
x = int(input())
l = A(x)
print(l)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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:
_temp = int(input())
if _temp >= 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:
t = int(input())

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

Submission status: Accepted

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


-40 <= X <= 40

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

Submission status: Accepted

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


if __name__ == "__main__":
    q1()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 閾値
threshold = 30
# 室温の入力
x = int(input())
# 判定
if x >= threshold:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys
import numpy as np
from math import ceil as C, floor as F
from collections import defaultdict as D
from functools import reduce as R
 
ALP = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
alp = 'abcdefghijklmnopqrstuvwxyz'
def _X(): return sys.stdin.readline().rstrip().split(' ')
def _S(ss): return tuple(ss) if len(ss) > 1 else ss[0]
def S(): return _S(_X())
def Ss(): return list(S())
def _I(ss): return tuple([int(s) for s in ss]) if isinstance(ss, tuple) else int(ss)
def I(): return _I(S())
def _Is(ss): return list(ss) if len(ss) > 1 else [ss]
def Is(): return _Is(I())
 
x = I()
print('Yes' if x >= 30 else 'No')

Submission status: Accepted

Solution code:
X = input()

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

Submission status: Accepted

Solution code:
temperature = int(input())

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

Submission status: Accepted

Solution code:
def solution(temp: int) -> None:
    if temp >= 30:
        print("Yes")
    else:
        print("No")


temp: int = int(input())
solution(temp)

Submission status: Accepted

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

else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def input():return sys.stdin.readline()[:-1]
def N(): return int(input())
def NM():return map(int,input().split())
def L():return list(NM())
n=N()
if n>=30:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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:
print(["No","Yes"][int(input())>=30])

Submission status: Accepted

Solution code:
x = int(input())
if 30<= x <= 40:
  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 -40 <= x <= 40:
    if 30 <= x:
        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=input() 
x=int(x) 
if x>=30:
  print ('Yes') 
else:
  print('No')

Submission status: Accepted

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

main()

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:
if __name__ =='__main__':
  n= int(input())
  if n>=30:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

Solution code:

x = int(input())

if 30 <= x:
  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 collections
from functools import lru_cache


def read():
    return input().strip()


def readInt():
    return int(input().strip())


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


x = readInt()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0

n = int(readline())

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