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

Submission status: Accepted

Solution code:
import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
# from scipy.sparse.csgraph import floyd_warshall
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations, combinations_with_replacement
from heapq import heappop, heappush, heapify
from fractions import gcd
# input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7

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

Submission status: Accepted

Solution code:
#n = int(input()) #入力
#a, b = (int(x) for x in input().split())
#a, b = map(int, input().split())

#a = [int(x) for x in input().split()]
#a = list(map(int, input().split()))
#a = [list(map(int,input().split(" "))) for i in range(N)]   #2次元


#a.sort() # C++ の sort(a.begin(), a.end());
#a.append(3) # C++ の a.push_back(3);


#exit(0) # return 0 的な。終了できる。
## 整数の切り捨て除算は // (ダブルスラッシュ)

import math
import copy
import string
#math.gcd(a, b) で、gcd 計算できる。
#math.pi は円周率。

INF = 10**18 #べき乗 C++ の pow(10, 18) or 1e18;
pi = math.pi

MOD = 1000000007
#MOD = 1000000009
#MOD = 998244353




#繰り返し2乗法
#N^aの、Mで割った余りを求める。
def my_pow(N, a, M):
    if(a == 0):
        return 1
    else:
        if(a % 2 == 0):
            tempo = my_pow(N, a/2, M)
            return (tempo * tempo) % M
        else:
            tempo = my_pow(N, a - 1, M)
            return (tempo * N) % M




#N_C_a を M で割った余り
def my_combination(N, a, M):
    res = 1

    for i in range(0, a):
        res *= N - i
        res %= M

    for i in range(0, a):
        res *= my_pow(i + 1, M - 2, M)
        res %= M

    return res




#N_C_i を M で割った余りを、v[i] に代入する。
def my_combination_table(N, M, v):
    if(len(v) < N + 1):
        l = N + 1 - len(v)
        tempo = [1] * l
        v.extend(tempo)

    for i in range(1, N + 1):
        v[i] = v[i - 1] * (N - (i - 1))
        v[i] %= M

        v[i] *= my_pow(i, M - 2, M)
        v[i] %= M

    return




#math.factorial で階乗は計算できる。
#math.gcd で gcd は計算できる。


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

Submission status: Accepted

Solution code:

import sys
input = sys.stdin.readline
def inp():
    return(int(input()))
T = inp()
print("No") if T<30 else print("Yes")

Submission status: Accepted

Solution code:
def a174(x):

    return "Yes" if x >= 30 else "No"

def main():
    x = int(input())
    print(a174(x))

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:
x=int(input())
if x>29:
    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:
print(f'{"Yes" if int(input()) >= 30 else "No"}')

Submission status: Accepted

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

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:
'''
    Auther: ghoshashis545 Ashis Ghosh
    College: jalpaiguri Govt Enggineering College

'''
from os import path
import sys
from heapq import heappush,heappop
from functools import cmp_to_key as ctk
from collections import deque,defaultdict as dd 
from bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right
from itertools import permutations
from datetime import datetime
from math import ceil,sqrt,log,gcd
def ii():return int(input())
def si():return input().rstrip()
def mi():return map(int,input().split())
def li():return list(mi())
abc='abcdefghijklmnopqrstuvwxyz'
mod=1000000007
# mod=998244353
inf = float("inf")
vow=['a','e','i','o','u']
dx,dy=[-1,1,0,0],[0,0,1,-1]

def bo(i):
    return ord(i)-ord('a')

file = 1





    
def solve():


    
    # for _ in range(ii()):

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











        
if __name__ =="__main__":

    if(file):

        if path.exists('input.txt'):
            sys.stdin=open('input.txt', 'r')
            sys.stdout=open('output.txt','w')
        else:
            input=sys.stdin.readline
    solve()

Submission status: Accepted

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

import sys
import glob

class InputGenerator(object):
    def __init__(self, input_path=None):
        if input_path != None:
            self.g = self.input_generator(input_path)
        else:
            self.g = None

    def input_generator(self, input_path):
        with open(input_path) as f:
            for line in f:
                yield line

    def get_input(self):
        if self.g == None:
            return input()
        else:
            return next(self.g)

def solve(gen):
    l = gen.get_input().rstrip()
    x = int(l)
    if x >= 30:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    test_flag = len(sys.argv) > 1

    if test_flag == True:
        file_path_list = sorted(glob.glob('test/*'))
    else:
        file_path_list = [None]

    for file_path in file_path_list:
        gen = InputGenerator(file_path)
        solve(gen)

Submission status: Accepted

Solution code:
import sys
from collections import defaultdict
readline = sys.stdin.buffer.readline
#sys.setrecursionlimit(10**8)


def geta(fn=lambda s: s.decode()):
    return map(fn, readline().split())


def gete(fn=lambda s: s.decode()):
    return fn(readline().rstrip())


def main():
    x = gete(int)

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
X = int(input())

if X > 29:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

import sys
import glob

class InputGenerator(object):
    def __init__(self, input_path=None):
        if input_path != None:
            self.g = self.input_generator(input_path)
        else:
            self.g = None

    def input_generator(self, input_path):
        with open(input_path) as f:
            for line in f:
                yield line

    def get_input(self):
        if self.g == None:
            return input()
        else:
            return next(self.g)

def show_trace(s, trace):
    offset = 0
    arrow = ''
    for i in trace:
        if i != 0:
            print('{}{}'.format(arrow, s[offset:offset+i]), end='')
            arrow = ' -> '
        offset += i
    print('')

def solve(s):
    valid_term_list = ['dream', 'dreamer', 'erase', 'eraser']
    offset_candidate_list = [[0]]

    while offset_candidate_list != []:
        trace = offset_candidate_list.pop()
        offset = sum(trace)

        for c in valid_term_list:
            c_len = len(c)
            if c == s[offset:offset + c_len]:
                offset_candidate_list.append(trace + [c_len])
                if offset + c_len == len(s):
                    # show_trace(s, trace + [c_len])
                    return True

    return False

if __name__ == '__main__':
    TEST_FLAG = False

    if TEST_FLAG == True:
        file_path_list = sorted(glob.glob('test/*'))
    else:
        file_path_list = [None]

    for file_path in file_path_list:
        gen = InputGenerator(file_path)
        l = gen.get_input().rstrip()
        x = int(l)
        if x >= 30:
            print('Yes')
        else:
            print('No')

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline


def print_ans(X):
    """Test Case
    >>> print_ans(30)
    Yes
    >>> print_ans(25)
    No
    >>> print_ans(35)
    Yes
    >>> print_ans(-10)
    No
    """
    if X >= 30:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    X = int(input().rstrip())
    print_ans(X)

Submission status: Accepted

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

import sys
sys.setrecursionlimit(300000)

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

def solve(X: int):
    if X >= 30:
        ret = YES
    else:
        ret = NO
    print(ret)
    return

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:
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:
#!/usr/bin/env python3


def main():
    if int(input()) >= 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:
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:
if(int(input()) >= 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())
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:
#!/usr/bin/env python
#-*- Coding:utf-8 -*-

x = int(input())

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

Submission status: Accepted

Solution code:
# get input from user and convert in to int
current_temp = int(input())

# Check that the restriction per task instruction is met
if (current_temp <= 40) and (current_temp >= -40):
    # Check if current_temp is greater than or equal to 30
    if current_temp >= 30:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
tmp = int(input())
if tmp>=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:
# import sys
# readline = sys.stdin.readline
# generator = (readline().strip() for _ in range(N))

# N, M = map(int, input().split())
# As = list(map(int, input().split()))
# queries = (input() for _ in range(N))


def solve():
    temperature = int(input())
    return ['No', 'Yes'][temperature >= 30]


def main():
    print(solve())


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
import numpy as np

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
now = int(input())

if now >= 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:

temp = int(input())

if temp >= 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:
import sys

readline = sys.stdin.readline
readall = sys.stdin.read
ns = lambda: readline().rstrip()
ni = lambda: int(readline().rstrip())
nm = lambda: map(int, readline().split())
nl = lambda: list(map(int, readline().split()))
prn = lambda x: print(*x, sep='\n')

def solve():
    print('Yes' if ni() >= 30 else 'No')
    return

solve()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
R = float(input())

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

Submission status: Accepted

Solution code:
degree = int(input())
if degree > 29:
  	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:
# input
X = int(input())

# step1
if X >= 30:
    switch = "Yes"
else:
    switch = "No"

# output
print(switch)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
print("Yes"if int(input())>=30 else "No")

Submission status: Accepted

Solution code:
n = int(input())
if n>=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:
import sys
input = sys.stdin.readline
ins = lambda: input().rstrip()
ini = lambda: int(input().rstrip())
inm = lambda: map(int, input().split())
inl = lambda: tuple(map(int, input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
now = int(input())

if now <30:
  print("No")
 
else:
  print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


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


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


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


def main():
    solve()


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import bisect
import sys
import math
from collections import deque
from heapq import heappush, heappop

def sRaw():
    return input().rstrip("\r")


def iRaw():
    return int(input())


def ssRaw():
    return input().split()


def isRaw():
    return list(map(int, ssRaw()))


INF = 1 << 29

DIV = (10**9) + 7
#DIV = 998244353

def mod_inv_prime(a, mod=DIV):
    return pow(a, mod-2, mod)


def mod_inv(a, b):
    r = a
    w = b
    u = 1
    v = 0
    while w != 0:
        t = r//w
        r -= t*w
        r, w = w, r
        u -= t*v
        u, v = v, u
    return (u % b+b) % b


def CONV_TBL(max, mod=DIV):
    fac, finv, inv = [0]*max, [0]*max, [0]*max
    fac[0] = fac[1] = 1
    finv[0] = finv[1] = 1
    inv[1] = 1
    for i in range(2, max):
        fac[i] = fac[i-1]*i % mod
        inv[i] = mod - inv[mod % i] * (mod//i) % mod
        finv[i] = finv[i-1]*inv[i] % mod

    class CONV:
        def __init__(self):
            self.fac = fac
            self.finv = finv
            pass

        def ncr(self, n, k):
            if(n < k):
                return 0
            if(n < 0 or k < 0):
                return 0
            return fac[n]*(finv[k]*finv[n-k] % DIV) % DIV

    return CONV()


def cumsum(As):
    s = 0
    for a in As:
        s += a
        yield s


sys.setrecursionlimit(200005)


def dijkstra(G,start=0):
    heap = []
    cost = [INF]*len(G)
    heappush(heap,(0,start))
    while len(heap)!=0:
        c,n = heappop(heap)
        if cost[n] !=INF:
            continue
        cost[n]=c
        for e in G[n]:
            ec,v = e
            if cost[v]!=INF:
                continue
            heappush(heap,(ec+c,v))
    return cost


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
    return list(map(int,input().split()))
def m(): #複数文字
    return map(int,input().split())
def onem(): #Nとかの取得
    return int(input())
def s(x): #圧縮
    a = []
    if len(x) == 0:
        return []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): #listをスペースごとに分ける
    return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
    return max(map(max,x))
def In(x,a): #aがリスト(sorted)
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False

def pow_k(x, n):
    ans = 1
    while n:
        if n % 2:
            ans *= x
        x *= x
        n >>= 1
    return ans

"""
def nibu(x,n,r):
    ll = 0
    rr = r
    while True:
        mid = (ll+rr)//2

    if rr == mid:
        return ll
    if (ここに評価入れる):
        rr = mid
    else:
        ll = mid+1
"""

n = onem()

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:
temp = int(input())
if (temp < -40)or(40 < temp):
  print('Error')
elif(30 <= temp):
  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 itertools import *

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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:

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
x = float(input())
if x>=30.0:
    print("Yes")
else: print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = input()

X = int(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:
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:
#https://atcoder.jp/contests/abc174/tasks/abc174_a

N= []
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 print('No')

Submission status: Accepted

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

Submission status: Accepted

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

if x >= 30:
  t = True

if t == True:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

val1 = input()

if int(val1) >= 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())
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:
temperature = int(input())
if temperature >= 30:
    print ("Yes")
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:
X = int(input())
if X < 30:
  print("No")
else:
  print("Yes")

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:
# coding: utf-8
# Your code here!
X = int(input())

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

Submission status: Accepted

Solution code:
x = int(input())
#str()文字式
#float()小数

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

Submission status: Accepted

Solution code:
temp=int(input())

if temp<30:
  print('No')

else:
  print('Yes')

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

Submission status: Accepted

Solution code:
from sys import stdin, stdout


def main():
    line = stdin.readline()
    parts = line.split()
    a = int(parts[0])
    rta = "No"
    if a >= 30:
        rta = "Yes"

    stdout.write(rta)


main()

Submission status: Accepted

Solution code:
from sys import stdin,stdout

def main():
    line=stdin.readline()
    parts=line.split()
    a=int(parts[0])
    if a>=30:
        stdout.write("Yes")
    else:
        stdout.write("No")
main()

Submission status: Accepted

Solution code:
from sys import stdin, stdout

def main():
    line = stdin.readline()
    parts = line.split()
    x = int(parts[0])
    stdout.write('Yes' if x>=30 else 'No')

main()

Submission status: Accepted

Solution code:
from sys import stdin, stdout

def problema(a):
    if a >= 30:
        return "Yes"
    else:
        return "No"

def main():
    line = stdin.readline()
    parts = line.split()
    a = int(parts[0])
    stdout.write(problema(a))
main()

Submission status: Accepted

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

if 30 <= ondo:
    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:
from collections import defaultdict as dd
from collections import deque
import bisect
import heapq

def ri():
    return int(input())

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


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





mode = 's'

if mode == 'T':
    t = ri()
    for i in range(t):
        solve()
else:
    solve()

Submission status: Accepted

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

Submission status: Accepted

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