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 re
import math
from collections import defaultdict,deque,Counter
from fractions import Fraction
import bisect
import itertools
from itertools import accumulate
from copy import deepcopy
import heapq
import random
import time
import os
import sys
from functools import lru_cache,reduce
readline=sys.stdin.readline
sys.setrecursionlimit(100000)
alp="abcdefghijklmnopqrstuvwxyz"
numbers="0123456789"
mod=int(10**9+7)
inf=int(10**19)
class Set():
    def __init__(self,A=[]):
        self.heap=[]
        self.dic=defaultdict(bool)
        self.size=0
        for a in A:self.add(a)
    
    def __str__(self):
        return str(self.heap)
    
    def add(self,x):
        if not self.find(x):
            heapq.heappush(self.heap,x)
            self.dic[x]=True
            self.size+=1

    def remove(self,x):
        if self.find(x):
            self.dic[x]=False
            self.size-=1

    def find(self,x):
        return self.dic[x]
    
    def top(self):
        while self.heap and self.dic[self.heap[0]]==False:
            heapq.heappop(self.heap)
        if self.heap:return self.heap[0]
        else:return None

    def pop(self):
        ret=None
        if self.heap:
            ret=self.top()
            self.remove(ret)
        return ret
class multiset():
    def __init__(self,A=[]):
        self.heap=[]
        self.dic=defaultdict(int)
        self.size=0
        for a in A:self.add(a)
    
    def __str__(self):
        return str(self.heap)
    
    def add(self,x):
        heapq.heappush(self.heap,x)
        self.dic[x]+=1
        self.size+=1

    def remove(self,x):
        if self.dic[x]>0:
            self.dic[x]-=1
            self.size-=1
    
    def count(self,x):
        return self.dic[x]

    def find(self,x):
        return self.dic[x]>0
    
    def top(self):
        while self.heap and self.dic[self.heap[0]]==0:
            heapq.heappop(self.heap)
        if self.heap:return self.heap[0]
        else:return None

    def pop(self):
        ret=None
        if self.heap:
            ret=self.top()
            self.remove(ret)
        return ret
class Edge():
    def __init__(self,x,y,val=1):
        self.x=x
        self.y=y
        self.val=val
class unionfind():
    def __init__(self,n):
        self.n=n
        self.P=[a for a in range(n)]
        self.rank=[0]*n
 
    def find(self,x):
        if(x!=self.P[x]):
            self.P[x]=self.find(self.P[x])
        return self.P[x]
 
    def same(self,x,y):
        return self.find(x)==self.find(y)
 
    def link(self,x,y):
        if self.rank[x]<self.rank[y]:
            self.P[x]=y
        elif self.rank[y]<self.rank[x]:
            self.P[y]=x
        else:
            self.P[x]=y
            self.rank[y]+=1
 
    def unite(self,x,y):
        self.link(self.find(x),self.find(y))
 
    def size(self):
        S=set()
        for a in range(self.n):
            S.add(self.find(a))
        return len(S)
def yn(b):print("yes" if b else "no")
def Yn(b):print("Yes" if b else "No")
def YN(b):print("YES" if b else "NO")
def ispow(a,b):
    now=b
    while now<a:
        now*=b
    return now==a
def getbin(num,size):
    A=[0]*size
    for a in range(size):
        if (num>>(size-a-1))&1==1:
            A[a]=1
        else:
            A[a]=0
    return A
def getfacs(n,mod_=0):
    A=[1]*(n+1)
    for a in range(2,len(A)):
        A[a]=A[a-1]*a
        if(mod_>0):A[a]%=mod_
    return A
def comb(n,r,mod,fac):
    if(n-r<0):return 0
    return (fac[n]*pow(fac[n-r],mod-2,mod)*pow(fac[r],mod-2,mod))%mod
def nextcomb(num,size):
    x=num&(-num)
    y=num+x
    z=num&(~y)
    z//=x
    z=z>>1
    num=(y|z)
    if(num>=(1<<size)):return False
    else:return num
def getprimes(n):
    if n==0:return []
    A=[True]*(n+1)
    A[0]=False
    A[1]=False
    for a in range(2,n+1):
        if A[a]:
            for b in range(a*2,n+1,a):
                A[b]=False
    ret=[]
    for a in range(n+1):
        if(A[a]):ret.append(a)
    return ret
def isprime(num):
    if(num<=1):return False
    i=2
    while i*i<=num:
       if(num%i==0):return False
       i+=1
    return True
def ifelse(b,t,f):return t if b else f
def factorize(n):
    b = 2
    ret=defaultdict(int)
    while b * b <= n:
        while n % b == 0:
            n //= b
            ret[b]+=1
        b+=1
    if n > 1:ret[n]+=1
    return ret
def inputintlist(row=1): 
    if row==1:
        ret=list(map(int,input().split()))
    else:
        ret=[None]*row
        for a in range(row):
            ret[a]=int(input())
    return ret
def inputfloatlist(row=1): 
    if row==1:
        ret=list(map(float,input().split()))
    else:
        ret=[None]*row
        for a in range(row):
            ret[a]=float(input())
    return ret
def istanchouzouka(A):
    f=True
    prev=min(A)-1
    for a in A:
        if prev>=a:
            f=False
        prev=a
    return f
def istanchouhigensyou(A):
    f=True
    prev=min(A)-1
    for a in A:
        if prev>a:
            f=False
        prev=a
    return f
def getallsum(A):
    s=sum(A)
    dp=defaultdict(int)
    dp[0]=1
    for a in range(0,len(A)):
        for b in range(s,-1,-1):
            if b-A[a]>=0:
                dp[b]+=dp[b-A[a]]
    return dp
def yuukoutomukou(edges):
    ret=deepcopy(edges)
    for edge in edges:
        if not edge.x==edge.y:
            ret.append(Edge(edge.y,edge.x,edge.val))
    return ret
def dijkstra(edges,V,start):
    mincost=[inf]*V
    G=[[] for a in range(V)]
    for edge in edges:
        G[edge.x].append([edge.val,edge.y])
    Q=PriorityQueue()
    Q.put([0,start])
    while not Q.empty():
        nowcost,nowx=Q.get()
        if mincost[nowx]==inf:
            mincost[nowx]=nowcost
            for cost,y in G[nowx]:
                newcost=nowcost+cost
                Q.put([newcost,y])
    return mincost
def warshallfloyd(edges,V):
    mincost=[[inf for b in range(V)] for a in range(V)]
    for a in range(V):mincost[a][a]=0
    for edge in edges:
        mincost[edge.x][edge.y]=min(mincost[edge.x][edge.y],edge.val)
    for k in range(V):
        for s in range(V):
            for t in range(V):
                if mincost[s][k]==inf or mincost[k][t]==inf:continue
                mincost[s][t]=min(mincost[s][t],mincost[s][k]+mincost[k][t])
    return mincost
def bellemanford(edges,V,start):
    mincost=[inf]*V
    mincost[start]=0
    for _ in range(V):
        for edge in edges:
            if mincost[edge.x]==inf:continue
            mincost[edge.y]=min(mincost[edge.y],mincost[edge.x]+edge.val)
    return mincost
def getmd(x1,y1,x2,y2):return abs(x1-x2)+abs(y1-y2)
def geted(x1,y1,x2,y2):return math.sqrt((x1-x2)**2+(y1-y2)**2)
class fordfulkerson():
    def __init__(self,edges,V,s,t):
        self.V=V
        self.used=[False]*V
        self.G=[[] for a in range(V)]
        self.s=s
        self.t=t
        for edge in edges:
            self.G[edge.x].append({"x":edge.x,"y":edge.y,"cap":edge.val,"rev":len(self.G[edge.y])})
            self.G[edge.y].append({"x":edge.y,"y":edge.x,"cap":0,"rev":len(self.G[edge.x])-1})
    def dfs(self,v,t,f=inf):
        if v==t:return f
        self.used[v]=True
        for a in range(len(self.G[v])):
            x=self.G[v][a]["x"]
            y=self.G[v][a]["y"]
            cap=self.G[v][a]["cap"]
            rev=self.G[y][self.G[x][a]["rev"]]
            if self.used[y] or cap==0:continue
            f2=self.dfs(y,t,min(f,cap))
            if f2>0:
                self.G[v][a]["cap"]-=f2
                rev["cap"]+=f2
                return f2
        return 0
    def maxflow(self):
        flow=0
        while True:
            self.used=[False]*V
            zouka=self.dfs(self.s,self.t)
            if zouka==0:break
            flow+=zouka
        return flow
def zipsort(*args):
    ziplist=sorted(zip(*args))
    for a in range(len(args)):
        for b in range(len(ziplist)):
            args[a][b]=ziplist[b][a]
def zipreverse(*args):
    ziplist=list(zip(*args))
    rev=[]
    for a in range(len(ziplist)-1,-1,-1):
        rev.append(ziplist[a])
    for a in range(len(args)):
        for b in range(len(rev)):
            args[a][b]=rev[b][a]

def to10(A):
    ret=0
    for a in range(len(A)-1,-1,-1):
        ret+=X[a]*2**(N-1-a)
    return ret


x=int(input())

Yn(x>=30)

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

import sys
input = sys.stdin.readline

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

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

Solution (Python):
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
print('Yes' if ii() >= 30 else 'No')

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

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

Solution (Python):
import os
import sys
import math
import heapq
from decimal import *
from io import BytesIO, IOBase
from collections import defaultdict, deque

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

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

Solution (Python):
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
from math import sqrt,ceil
from collections import deque
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())
print('Yes' if x>=30 else 'No')

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

Solution (Python):



def solve(*args: str) -> str:
    x = int(args[0])

    return 'Yes' if 30 <= x else 'No'


if __name__ == "__main__":
    print(solve(*(open(0).read().splitlines())))

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

sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inl = lambda: [int(x) for x in sys.stdin.readline().split()]
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))


x = ini()


def solve():
    return x >= 30


print("Yes" if solve() else "No")

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

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

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

Solution (Python):



import math
import itertools

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


def get_camulative(l):
    return [0] + list(itertools.accumulate(l))

def combinations_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

def count(mazes, hc, wc):
    hc = list(hc)
    wc = list(wc)
    r = 0
    for hi, row in enumerate(mazes):
        if hi in hc:
            continue
        for wi, m in enumerate(row):
            if wi in wc:
                continue
            if m == '
                r += 1
    return r

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

def input_list_str():
    return list(map(str, input().split()))

if __name__ == '__main__':
    main()

Solution (Python):

x = int(input())

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

Solution (Python):

import sys,io,os,time
from collections import defaultdict
from collections import OrderedDict
from collections import deque
from itertools import combinations
from itertools import permutations
import bisect,math,heapq
alphabet = "abcdefghijklmnopqrstuvwxyz"

input = sys.stdin.readline



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

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

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

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

Solution (Python):
import sys; input = sys.stdin.buffer.readline
sys.setrecursionlimit(10**7)
from collections import defaultdict
con = 10 ** 9 + 7; INF = float("inf")

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


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




if __name__ == '__main__':
	main()

Solution (Python):
import sys
import math
import collections
import decimal
import itertools
from collections import deque
from functools import reduce
import heapq
import copy
x = int(input())





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

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

X = INT()

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

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

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

Solution (Python):

import bisect
import heapq
import math
import random
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub


import sys


buff_readline = sys.stdin.readline
readline = sys.stdin.readline

INF = 2**62-1


def read_int():
    return int(buff_readline())


def read_int_n():
    return list(map(int, buff_readline().split()))


def read_float():
    return float(buff_readline())


def read_float_n():
    return list(map(float, buff_readline().split()))


def read_str():
    return readline().strip()


def read_str_n():
    return readline().strip().split()

def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(X):
    return 'Yes' if X >= 30 else 'No'


def main():
    X = read_int()
    print(slv(X))


if __name__ == '__main__':
    main()

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


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

Solution (Python):
def main():
    temp = int(input())
    if temp >= 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():
    x = 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):
import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")

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

Solution (Python):
import sys, bisect, math, itertools, heapq, collections
from operator import itemgetter

from functools import lru_cache

sys.setrecursionlimit(10**8)
input = sys.stdin.readline
INF = float('inf')
mod = 10**9 + 7
eps = 10**-7


def inp():
    '''
    一つの整数
    '''
    return int(input())


def inpl():
    '''
    一行に複数の整数
    '''
    return list(map(int, input().split()))


def str_inp():
    '''
    文字列をリストとして読み込む
    '''
    return list(input()[:-1])


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


if __name__ == '__main__':
    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")

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

Solution (Python):
import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)

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


def get_nums_l():
    return [ int(s) for s in input().split(" ")]


def get_all_int():
    return map(int, open(0).read().split())

def log(*args):
    print("DEBUG:", *args, file=sys.stderr)

def main():
    INF = 999999999999999999999999
    MOD = 10**9+7

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

main()

Solution (Python):
import sys

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

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):
import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush,heapify
from math import ceil, floor, sqrt
from copy import deepcopy


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


if __name__ == '__main__':
	main()

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

Solution (Python):
import sys
input=lambda: sys.stdin.readline().rstrip()
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):
import sys

read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


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

Solution (Python):
from functools import reduce
from fractions import gcd
import math
import bisect
import itertools
import sys
input = sys.stdin.readline
INF = float("inf")



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

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

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

Solution (Python):
import sys
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())
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
input = lambda: sys.stdin.readline().rstrip("\r\n")

x = int(input())

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

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

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

Solution (Python):
import sys

input = sys.stdin.readline

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

Solution (Python):





import math
import fractions
import sys
import bisect
import heapq  
import collections
from collections import Counter
from collections import deque
import pprint
import itertools

sr = lambda: input()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

"""nを素因数分解"""
"""2以上の整数n => [[素因数, 指数], ...]の2次元リスト"""


def factorization(n):
    arr = []
    temp = n
    if n == 1:
        return arr

    for i in range(2, int(-(-n ** 0.5 // 1)) + 1):
        if temp % i == 0:
            cnt = 0
            while temp % i == 0:
                cnt += 1
                temp //= i
            arr.append([i, cnt])

    if temp != 1:
        arr.append([temp, 1])

    if arr == []:
        arr.append([n, 1])

    return arr



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



def kaijo(n, l, mod):
    if n == 0:
        return 1
    a = n
    tmp = n - 1
    while (tmp >= l):
        a = a * tmp % mod
        tmp -= 1
    return a


class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())


def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    divisors.sort()
    return divisors


inf = 10 ** 18
mod = 10 ** 9 + 7

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

Solution (Python):
from sys import stdin, setrecursionlimit

setrecursionlimit(10 ** 7)

from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
from collections import deque, defaultdict, Counter
from itertools import combinations, permutations, combinations_with_replacement
from itertools import accumulate
from math import ceil, sqrt, pi, radians, sin, cos

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

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

    
if '__main__' == __name__:
    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):
X = int(input())

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

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

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

Solution (Python):


from pprint import pprint
from collections import deque, defaultdict
import itertools
import math
import sys

sys.setrecursionlimit(10 ** 6)
INF = float('inf')


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 math import *

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

def cins(): 
    return input.split()

def cino(test=False): 
    if not test:
        return int(input())
    else: 
        return input()

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

def ssplit(): 
    return list(input().split())

def printlist(l): 
    for i in l:
        print(i,end=" ")

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

if __name__ == '__main__':
    main()

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

import sys
sys.setrecursionlimit(10**7)

readline = sys.stdin.buffer.readline
def readstr():return readline().rstrip().decode()
def readstrs():return list(readline().decode().split())
def readint():return int(readline())
def readints():return list(map(int,readline().split()))
def printrows(x):print('\n'.join(map(str,x)))
def printline(x):print(' '.join(map(str,x)))

x = readint()

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

Solution (Python):



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

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