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

if num >= 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):
n = int(input())
if n >= 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())
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):
import sys


def input():
    return sys.stdin.readline().strip()


sys.setrecursionlimit(20000000)

MOD = 10 ** 9 + 7
INF = float("inf")


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


if __name__ == "__main__":
    main()

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7


def input():
    return sys.stdin.readline().strip()


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

if __name__ == "__main__":
    main()

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

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

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

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

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

Solution (Python):
import sys
input=sys.stdin.readline
num=int(input())
if num>=30:
    print("Yes")
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())
print("Yes" if x>=30 else "No")

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

Solution (Python):
print('YNeos'[int(input())<30::2])

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

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

Solution (Python):




from sys import stdin, stdout, setrecursionlimit
from math import gcd, ceil, sqrt
from collections import Counter
from bisect import bisect_left, bisect_right
ii1 = lambda: int(stdin.readline().strip())
is1 = lambda: stdin.readline().strip()
iia = lambda: list(map(int, stdin.readline().strip().split()))
isa = lambda: stdin.readline().strip().split()
setrecursionlimit(100000)
mod = 1000000007

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

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
N = I()
if N > 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):
a = int(input())
if a >= 30:
  print("Yes")
else:
  print("No")

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

Solution (Python):

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

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


if __name__ == '__main__':
    main()

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

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


def get_input() -> int:
    """
    標準入力を取得する.

    Returns:\n
        int: 室温
    """
    X = int(input())

    return X


def main(X: int) -> None:
    """
    メイン処理.

    Args:\n
        X (int): 室温（-40 <= X <= 40, 整数）
    """
    
    ans = str()
    if X >= 30:
        ans = "Yes"
    else:
        ans = "No"

    
    print(ans)


if __name__ == "__main__":
    
    X = get_input()

    
    main(X)

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

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

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

Solution (Python):
from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
from collections import deque,Counter
from operator import mul
import copy


import heapq
sys.setrecursionlimit(10**6)

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

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

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

Solution (Python):

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

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

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

if __name__ == '__main__':
    X = int(input())
    aircon(X)

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

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

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

Solution (Python):

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

Solution (Python):
import collections



X = int(input())

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

Solution (Python):
from sys import stdin
X = int(stdin.readline().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>=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 'No')

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

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

Solution (Python):
from sys import exit





X, = map(int, input().split())

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

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

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

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

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

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

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

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

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

Solution (Python):




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

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


if __name__ == "__main__":
    main()

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

Solution (Python):

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

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

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=input()
x=int(x)
if -40<=x and x<=40:
    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"
elif x < 30:
  ans = "No"
print(ans)

Solution (Python):

in_data = int(input())


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

solve(int(input()))

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('No')
elif X>= 30:
    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):
def solve():
    print("Yes") if int(input()) >= 30 else print("No")
    return 0

if __name__ == "__main__":
    solve()

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,bisect,string,math,time,functools,random,fractions
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
rep=range;R=range
def Golf():n,*t=map(int,open(0).read().split())
def I():return int(input())
def S_():return input()
def IS():return input().split()
def LS():return [i for i in input().split()]
def MI():return map(int,input().split())
def LI():return [int(i) for i in input().split()]
def LI_():return [int(i)-1 for i in input().split()]
def NI(n):return [int(input()) for i in range(n)]
def NI_(n):return [int(input())-1 for i in range(n)]
def StoLI():return [ord(i)-97 for i in input()]
def ItoS(n):return chr(n+97)
def LtoS(ls):return ''.join([chr(i+97) for i in ls])
def Ra():return map(int,open(0).read().split())
def GI(V,E,ls=None,Directed=False,index=1):
    org_inp=[];g=[[] for i in range(V)]
    FromStdin=True if ls==None else False
    for i in range(E):
        if FromStdin:
            inp=LI()
            org_inp.append(inp)
        else:
            inp=ls[i]
        if len(inp)==2:
            a,b=inp;c=1
        else:
            a,b,c=inp
        if index==1:a-=1;b-=1
        aa=(a,c);bb=(b,c);g[a].append(bb)
        if not Directed:g[b].append(aa)
    return g,org_inp
def GGI(h,w,search=None,replacement_of_found='.',mp_def={'
    
    mp=[boundary]*(w+2);found={}
    for i in R(h):
        s=input()
        for char in search:
            if char in s:
                found[char]=((i+1)*(w+2)+s.index(char)+1)
                mp_def[char]=mp_def[replacement_of_found]
        mp+=[boundary]+[mp_def[j] for j in s]+[boundary]
    mp+=[boundary]*(w+2)
    return h+2,w+2,mp,found
def TI(n):return GI(n,n-1)
def accum(ls):
    rt=[0]
    for i in ls:rt+=[rt[-1]+i]
    return rt
def bit_combination(n,base=2):
    rt=[]
    for tb in R(base**n):s=[tb//(base**bt)%base for bt in R(n)];rt+=[s]
    return rt
def gcd(x,y):
    if y==0:return x
    if x%y==0:return y
    while x%y!=0:x,y=y,x%y
    return y
def YN(x):print(['NO','YES'][x])
def Yn(x):print(['No','Yes'][x])
def show(*inp,end='\n'):
    if show_flg:print(*inp,end=end)

mo=10**9+7
inf=float('inf')
FourNb=[(-1,0),(1,0),(0,1),(0,-1)];EightNb=[(-1,0),(1,0),(0,1),(0,-1),(1,1),(-1,-1),(1,-1),(-1,1)];compas=dict(zip('WENS',FourNb));cursol=dict(zip('LRUD',FourNb))
l_alp=string.ascii_lowercase
sys.setrecursionlimit(10**9)
read=sys.stdin.buffer.read;readline=sys.stdin.buffer.readline;input=lambda:sys.stdin.readline().rstrip()




def dijkstra(edge,st):
    
    
    n=len(edge)
    d=[(0 if st==i else inf) for i in range(n)]
    q=[(j,i) for i,j in enumerate(d)]
    heapify(q)
    v=[False]*n
    
    while q:
        dist,cur=heappop(q)
        if v[cur]:
            continue
        v[cur]=True
        for dst,dist in edge[cur]:
            alt=d[cur]+c[cur]
            if alt<d[dst]:
                d[dst]=alt
                heappush(q,(alt,dst))
    return d

class UnionFind:
    def __init__(self, n):
        
        
        self.table = [-1] * n
 
    def _root(self, x):
        if self.table[x] < 0:
            return x
        else:
            
            self.table[x] = self._root(self.table[x])
            return self.table[x]
 
    def find(self, x, y):
        return self._root(x) == self._root(y)
 
    def union(self, x, y):
        r1 = self._root(x)
        r2 = self._root(y)
        if r1 == r2:
            return
        
        d1 = self.table[r1]
        d2 = self.table[r2]
        if d1 <= d2:
            self.table[r2] = r1
            if d1 == d2:
                self.table[r1] -= 1
        else:
            self.table[r1] = r2
    
    def __str__(self):
        rt=[i if j<0 else j for i,j in enumerate(self.table)]
        return str(rt)

class Comb:
    def __init__(self,n,mo=10**9+7):
        self.fac=[0]*(n+1)
        self.inv=[1]*(n+1)
        self.fac[0]=1
        self.fact(n)
        for i in range(1,n+1):
            self.fac[i]=i*self.fac[i-1]%mo
            self.inv[n]*=i
            self.inv[n]%=mo
        self.inv[n]=pow(self.inv[n],mo-2,mo)
        for i in range(1,n):
            self.inv[n-i]=self.inv[n-i+1]*(n-i+1)%mo
        return
    
    def fact(self,n):
        return self.fac[n]
        
    def invf(self,n):
        return self.inv[n]

    def comb(self,x,y):
        if y<0 or y>x:
            return 0
        return self.fac[x]*self.inv[x-y]*self.inv[y]%mo



show_flg=False
show_flg=True

ans=0


Yn(I()>=30)

Solution (Python):
import sys
import math
import heapq
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
DVSR = 1000000007
def POW(x, y): return pow(x, y, DVSR)
def INV(x, m=DVSR): return pow(x, m - 2, m)
def DIV(x, y, m=DVSR): return (x * INV(y, m)) % m
def LI(): return map(int, sys.stdin.readline().split())
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())


def FLIST(n):
    res = [1]
    for i in range(1, n+1):
        res.append(res[i-1]*i % DVSR)
    return res


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

if __name__ == "__main__":
    main()

Solution (Python):



YES = 'Yes'
NO = 'No'

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

def main():
    X = int(input())
    a = solve(X)
    print(a)

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

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

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

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):
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):
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())
def Main(X):
    return "Yes" if X >= 30 else "No"

print(Main(X))

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

Solution (Python):
X=int(input())
print(X>=30 and 'Yes' or 'No')

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

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

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


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

Solution (Python):

def main():
    X = int(input())
    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):
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):
from sys import stdin, stdout, setrecursionlimit
from collections import deque, defaultdict, Counter
from heapq import heappush, heappop
from functools import lru_cache
import math


rl = lambda: stdin.readline()
rll = lambda: stdin.readline().split()
rli = lambda: map(int, stdin.readline().split())
rlf = lambda: map(float, stdin.readline().split())

INF, NINF = float('inf'), float('-inf')
MOD = 10**9 + 7

def main():
	x = int(rl())
	if x >= 30:
		print("Yes")
	else:
		print("No")
	stdout.close()

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

Solution (Python):
print('YNeos'[int(input())<30::2])

Solution (Python):
print('YNeos'[int(input())<30::2])

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

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

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

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

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

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

Solution (Python):
import sys
for l in sys.stdin:
	a = int(l)
	if a >= 30:
		print("Yes")
	else:
		print("No")

Solution (Python):
import sys
for l in sys.stdin:
	if int(l) >= 30:
		print("Yes")
	else:
		print("No")

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

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

Solution (Python):
import math as mt
import sys, string
from collections import Counter, defaultdict
input = sys.stdin.readline

MOD = 1000000007

I = lambda : int(input())
M = lambda : map(int, input().split())
Ms = lambda : map(str, input().split()) 
ARR = lambda : list(map(int, input().split()))

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


tc = 1
for _ in range(tc):
    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):
n = int(input())

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

Solution (Python):

import sys
import math
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import itertools
import random
from collections import deque
from decimal import *
import queue

input = sys.stdin.readline

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
def inputStr(): return input()[:-1]

inf = float('inf')
mod = 1000000007




def main():
	N = inputInt()

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

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

Solution (Python):
import sys
print('Yes' if int(sys.stdin.readline().rstrip()) >= 30 else 'No')

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

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

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

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

Solution (Python):
import sys
INF = 1 << 60
MOD = 10**9 + 7 
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
def resolve():
    print("Yes" if int(input()) >= 30 else "No")
resolve()

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