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

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

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

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

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

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

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

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

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

Solution (Python):
rt = int(input())

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

Solution (Python):
rt = int(input())

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

Solution (Python):
rt = int(input())

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

Solution (Python):
ans = input()

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

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

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

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

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

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

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

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

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

Solution (Python):

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

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

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

Solution (Python):
xin = int(input())

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

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


if __name__ == '__main__':
    main()

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

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

Solution (Python):
import sys, bisect, math, itertools, string, queue, copy



from collections import Counter,defaultdict,deque
from itertools import permutations, combinations, combinations_with_replacement
from heapq import heappop, heappush, heapify
from fractions import gcd

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

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

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

Solution (Python):
















import math
import copy
import string



INF = 10**18 
pi = math.pi

MOD = 1000000007








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





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





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








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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
x=int(input())
ans='No'
if x>=30:
    ans='Yes'
print(ans)

Solution (Python):

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

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

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

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

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

Solution (Python):
def a174(x):

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

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

if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
print(f'{"Yes" if int(input()) >= 30 else "No"}')

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
'''
    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

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():


    
    

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

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

Solution (Python):



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)

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

Solution (Python):
import sys
from collections import defaultdict
readline = sys.stdin.buffer.readline



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

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

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

Solution (Python):



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):
                    
                    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')

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

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


if __name__ == '__main__':
    main()

Solution (Python):
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)

Solution (Python):


import sys
sys.setrecursionlimit(300000)

YES = "Yes"  
NO = "No"  

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))  
    solve(X)

if __name__ == '__main__':
    main()

Solution (Python):


import sys
sys.setrecursionlimit(300000)

YES = "Yes"  
NO = "No"  

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))  
    solve(X)

if __name__ == '__main__':
    main()

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

Solution (Python):


import sys
sys.setrecursionlimit(300000)

YES = "Yes"  
NO = "No"  

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))  
    solve(X)

if __name__ == '__main__':
    main()

Solution (Python):


import sys
sys.setrecursionlimit(300000)

YES = "Yes"  
NO = "No"  

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))  
    solve(X)

if __name__ == '__main__':
    main()

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

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

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

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

Solution (Python):
temp = int(input())

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

Solution (Python):



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


if __name__ == "__main__":
    main()

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

Solution (Python):
N = int(input())

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

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

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

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

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

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

else:
    print("No")

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

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

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

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

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

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

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

Solution (Python):

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

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

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

Solution (Python):



x = int(input())

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

Solution (Python):

current_temp = int(input())


if (current_temp <= 40) and (current_temp >= -40):
    
    if current_temp >= 30:
        print("Yes")
    else:
        print("No")

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

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

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

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

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

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

Solution (Python):









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


def main():
    print(solve())


if __name__ == "__main__":
    main()

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

Solution (Python):
n = int(input())

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

Solution (Python):
import numpy as np

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

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

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

Solution (Python):
now = int(input())

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

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

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

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

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

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

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

Solution (Python):

temp = int(input())

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

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

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

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

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

Solution (Python):
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()

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

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

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

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

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

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

Solution (Python):
R = float(input())

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

Solution (Python):
degree = int(input())
if degree > 29:
  	print("Yes")
else:
  	print("No")

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

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

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

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

Solution (Python):

X = int(input())


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


print(switch)

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

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

Solution (Python):


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

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

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

Solution (Python):
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")

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

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

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

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

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

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

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

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

if __name__ == '__main__':
    solve()

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

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

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

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

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

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

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

Solution (Python):
now = int(input())

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

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

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

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

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

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

Solution (Python):
"""A-Air Conditioner"""
X=int(input())
if X>=30:
    print("Yes")
else:
    print("No")

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

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

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

if __name__ == '__main__':
    main()

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

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

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

Solution (Python):

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

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

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

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

Solution (Python):
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


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

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

Solution (Python):
n = int(input())

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

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

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

Solution (Python):
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): 
    return list(map(int,input().split()))
def m(): 
    return map(int,input().split())
def onem(): 
    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): 
    return " ".join(map(str,x))
def max2(x): 
    return max(map(max,x))
def In(x,a): 
    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")

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

Solution (Python):
temp = int(input())
if (temp < -40)or(40 < temp):
  print('Error')
elif(30 <= temp):
  print('Yes')
else:
  print('No')

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

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

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

Solution (Python):
from itertools import *

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

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

Solution (Python):
x = input()

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

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

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

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

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

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

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

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

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

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

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

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



if __name__ == main():
    main()

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

Solution (Python):

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


if __name__ == "__main__":
    main()

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
A = eval(input())
print("No") if A < 30 else print("Yes")

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

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

Solution (Python):

x = int(input())

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

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

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

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

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

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

else:
    print("No")

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

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

Solution (Python):
X = input()

X = int(X)

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

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

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

Solution (Python):
N = int(input())

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

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

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

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

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

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

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

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

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

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

Solution (Python):


N= []
N= int(input(" "))

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

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

Solution (Python):
n=int(input())

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

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

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

if x >= 30:
  t = True

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