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):
import sys
from io import StringIO
import unittest
import os


sys.setrecursionlimit(999999999)



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

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



class TestClass(unittest.TestCase):
    def assertIO(self, assert_input, output):
        stdout, sat_in = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(assert_input)
        resolve(sys._getframe().f_back.f_code.co_name)
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, sat_in
        self.assertEqual(out, output)

    def test_input_1(self):
        test_input = """25"""
        output = """No"""
        self.assertIO(test_input, output)

    def test_input_2(self):
        test_input = """30"""
        output = """Yes"""
        self.assertIO(test_input, output)

    
    def tes_t_1original_1(self):
        test_input = """データ"""
        output = """データ"""
        self.assertIO(test_input, output)



if __name__ == "__main__":
    if os.environ.get("USERNAME") is None:
        
        resolve()

    else:
        
        unittest.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):

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

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

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

Solution (Python):
import sys

N = int(sys.stdin.readline().strip())
print("Yes" if N >= 30 else "No")

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

Solution (Python):
temp = int(input())
if temp >= 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):
def main():
    X = int(input())
    

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

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

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

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

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

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

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

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

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

Solution (Python):
from sys  import stdin,stdout

import bisect

import math

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

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

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

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

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

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

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

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


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


for _ in range(1):
    solve()

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

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

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

def resolve():
    X = I()

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

if __name__ == '__main__':
    resolve()

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

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

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

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

if __name__ == "__main__":
    main()

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

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

import sys
import numpy as np

YES = "Yes"  
NO = "No"  


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

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

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

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

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

input = sys.stdin.readline

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

if __name__ == '__main__':
    main()

Solution (Python):
def main():
    n = int(input())
    if n >= 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):


import numpy as np

kita = int(input())

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

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

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

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

Solution (Python):



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

N = int(input())

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

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

import math
from queue import PriorityQueue
import bisect
import copy
import time
from collections import Counter


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):
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):
import random


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


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


n = int(input())


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

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

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

if __name__ == "__main__":
    solve()

Solution (Python):
if __name__ == '__main__':

	n = int(input())

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

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


if __name__ == '__main__':
    solve()

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

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

Solution (Python):
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):
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):
import sys,math
from collections import deque,defaultdict
import operator as op
from functools import reduce

I=sys.stdin.readline

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


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





		










		


		










		






if __name__ == '__main__':
	main()

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

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

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

Solution (Python):
print('Yes')if(int(input())>=30) 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):
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):
def resolve():
    n = int(input())
    if n >= 30:
        print('Yes')
    else:
        print('No')

resolve()

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

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

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

Solution (Python):
import math





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


if __name__ == "__main__":
    main()

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

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

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

Solution (Python):



import sys

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

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

main()

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

Solution (Python):
import sys

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


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

if __name__ == "__main__":
	main()

Solution (Python):
n = int(input())
if n>29:
  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):
import numpy as np
import math
import scipy as sp
import queue
import collections

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

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

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

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

    cout = main(kwargs)
    print(cout)

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

def main():
    input = sys.stdin.readline
    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):
X=int(input())
if X<30:
    print("No")
else:
    print("Yes")

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

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

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

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

print(ans)

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):
import sys

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

printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split())
ins = lambda : input().strip()
DBG = True 
BIG = 10**18
R = 10**9 + 7


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

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

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

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

Solution (Python):
if __name__ == "__main__":
    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 :
    ans = 'Yes'
else :
    ans = 'No'

print(ans)

Solution (Python):



import collections
import sys
import copy
import re
import math


def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())


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


if __name__ == '__main__':
    main()

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

Solution (Python):
print('Yes' if int(input()) > 29 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:
    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):
a=int(input())

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

Solution (Python):

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

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):
import sys

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

N = INT()

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

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):
import sys
import re
import math
import collections
import bisect
import itertools
import fractions
import functools
import copy
import heapq
import decimal
import statistics
import queue



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


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





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


if __name__ == '__main__':
    main()

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

Solution (Python):




import sys
from io import StringIO
import unittest

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

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

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

    return

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

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

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

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

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

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

import sys

input = sys.stdin.readline


def Y():
    print("Yes")


def N():
    print("No")


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


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


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


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

Solution (Python):
a=int(input())
if a>= 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):
def main():
    k = int(input())
    if k >= 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):
x = int(input())

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

Solution (Python):
t = int(input())
print("Yes" if t >= 30 else "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):
import sys
from os import path

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

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

Solution (Python):
from sys import stdin

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

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

if __name__ == "__main__":
    main()

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

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

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

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


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


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