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
input= lambda: sys.stdin.readline().rstrip()
def pin(type=int):return map(type,input().split())
def tupin(t=int):return tuple(pin(t))
def lispin(t=int):return list(pin(t))

def resolve():
    N,=pin()
    print(["No","Yes"][N>=30])

    


resolve()

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


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


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


    pass


if __name__ == "__main__":
    main()

Solution (Python):
def main():
    from sys import setrecursionlimit, stdin, stderr
    from os import environ
    from collections import defaultdict, deque, Counter
    from math import ceil, floor
    from itertools import accumulate, combinations, combinations_with_replacement
    setrecursionlimit(10**6)
    dbg = (lambda *something: stderr.write("\033[92m{}\033[0m".format(str(something)+'\n'))) if 'TERM_PROGRAM' in environ else lambda *x: 0
    input = lambda: stdin.readline().rstrip()
    LMIIS = lambda: list(map(int,input().split()))
    II = lambda: int(input())
    P = 10**9+7
    INF = 10**18+10

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

    
main()

Solution (Python):
import sys
input = sys.stdin.readline


def readstr():
    return input().strip()


def readint():
    return int(input())


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


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


def main():
    X = readint()
    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):
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):
def resolve():
    X = int(input())
    print("Yes" if X>= 30 else "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):
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):
import sys
import copy
def S(): return sys.stdin.readline().rstrip()
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())
INF = 1000000000000

x = I()

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

Solution (Python):
from sys import stdin, stdout
import math,sys,heapq
from itertools import permutations, combinations
from collections import defaultdict,deque,OrderedDict
from os import path
import bisect as bi
def yes():print('YES')
def no():print('NO')
if (path.exists('input.txt')): 
    
    sys.stdin=open('input.txt','r');sys.stdout=open('output.txt','w');
    def I():return (int(input()))
    def In():return(map(int,input().split()))
else:
    
    def I():return (int(stdin.readline()))
    def In():return(map(int,stdin.readline().split()))

def dict(a):
    d={}
    for x in a:
        if d.get(x,-1)!=-1:
            d[x]+=1
        else:
            d[x]=1
    return d

def find_gt(a, x):
    'Find leftmost value greater than x'
    i = bi.bisect_right(a, x)
    if i != len(a):
        return i
    else:            
        return -1

def main():
    try:
        n=I()
        if n>=30:
            print('Yes')
        else:
            print('No')

    except:
        pass
        
M = 998244353
P = 1000000007
 
if __name__ == '__main__':
    
    for _ in range(1):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):
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())
print('Yes' if x>=30 else '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):
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):

import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial
from bisect import bisect_left, bisect_right 
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input(): return sys.stdin.readline()[:-1]
pl = lambda x: print(*x, sep='\n')

N = int(input())

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

Solution (Python):

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

Solution (Python):


'''
Author: andyli
Time: 2020-08-02 19:55:47
'''

import os
from io import BytesIO, IOBase
import sys


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



BUFSIZE = 1048576


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = 'x' in file.mode or 'r' not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b'\n') + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode('ascii'))
        self.read = lambda: self.buffer.read().decode('ascii')
        self.readline = lambda: self.buffer.readline().decode('ascii')


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
def input(): return sys.stdin.readline().rstrip('\r\n')




if __name__ == '__main__':
    main()

Solution (Python):

from collections import defaultdict, deque, Counter, OrderedDict
from bisect import bisect_left, bisect_right
from functools import reduce, lru_cache
from heapq import heappush, heappop, heapify

import itertools
import bisect
import math
import fractions
import sys
import copy


def L(): return sys.stdin.readline().split()


def I(): return int(sys.stdin.readline().rstrip())


def S(): return list(sys.stdin.readline().rstrip())


def LI(): return [int(x) for x in sys.stdin.readline().split()]


def LI1(): return [int(x) - 1 for x in sys.stdin.readline().split()]


def LS(): return [list(x) for x in sys.stdin.readline().split()]


def IR(n): return [I() for _ in range(n)]


def LIR(n): return [LI() for _ in range(n)]


def LIR1(n): return [LI1() for _ in range(n)]


def SR(n): return [S() for _ in range(n)]


def LSR(n): return [LS() for _ in range(n)]


def LR(n): return [L() for _ in range(n)]


alphabets = "abcdefghijklmnopqrstuvwxyz"
ALPHABETS = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"

sys.setrecursionlimit(1000000)
dire = [[1, 0], [0, 1], [-1, 0], [0, -1]]
dire8 = [[1, 0], [1, 1], [0, 1], [-1, 1], [-1, 0], [-1, -1], [0, -1], [1, -1]]
MOD = 1000000007


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


if __name__ == '__main__':
    main()

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

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

Solution (Python):
import sys
readline = sys.stdin.readline

def solve():
    X = int(readline())

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

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

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

Solution (Python):
def s(): return input()
def i(): 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()))
count = 0
ans = 0

X = i()

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

Solution (Python):
import sys
sys.setrecursionlimit(10**7) 
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right

from collections import deque, defaultdict


from collections import Counter

from itertools import accumulate,combinations,permutations,product

from heapq import heapify,heappop,heappush

from functools import reduce,lru_cache

from decimal import Decimal

def input(): 
    x=sys.stdin.readline()
    return x[:-1] if x[-1]=="\n" else x
def printe(*x):print("
def printl(li): _=print(*li, sep="\n") if li else None
def argsort(s, return_sorted=False): 
    inds=sorted(range(len(s)), key=lambda k: s[k])
    if return_sorted: return inds, [s[i] for i in inds]
    return inds
def alp2num(c,cap=False): return ord(c)-97 if not cap else ord(c)-65
def num2alp(i,cap=False): return chr(i+97) if not cap else chr(i+65)
def matmat(A,B):
    K,N,M=len(B),len(A),len(B[0])
    return [[sum([(A[i][k]*B[k][j]) for k in range(K)]) for j in range(M)] for i in range(N)]
def matvec(M,v):
    N,size=len(v),len(M)
    return [sum([M[i][j]*v[j] for j in range(N)]) for i in range(size)]
def T(M):
    n,m=len(M),len(M[0])
    return [[M[j][i] for j in range(n)] for i in range(m)]
def binr(x): return bin(x)[2:]
def bitcount(x): 
    x= x - ((x >> 1) & 0x5555555555555555)
    x= (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333)
    x= (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0f 
    x+= (x >> 8); x+= (x >> 16); x+= (x >> 32) 
    return x & 0x7f

def main():
    mod = 1000000007
    

    N = int(input())
    
    
    
    


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



if __name__ == "__main__":
    main()

Solution (Python):
import sys, math

if(__name__ == "__main__"):
    X = int( input().strip() )
    
    
    if(X >= 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())
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):
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")
    exit()
print("No")

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

Solution (Python):
x = int(input())
print(['No','Yes'][30 <= x])

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

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

Solution (Python):
import sys

sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))  
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))  
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())  
def LS2(): return list(sys.stdin.readline().rstrip())  

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

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

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

print("Yes" if n >= 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):
import sys
sys.setrecursionlimit(10**9)

def mi(): return map(int,input().split())
def ii(): return int(input())
def isp(): return input().split()
def deb(text): print("-------\n{}\n-------".format(text))

INF=10**20
def main():
    X=ii()
    print("Yes" if X >= 30 else "No")




if __name__ == "__main__":
    main()

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

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

Solution (Python):
def main():

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


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

Solution (Python):
from math import ceil,floor,factorial,gcd,sqrt,log2,cos,sin,tan,acos,asin,atan,degrees,radians,pi,inf,comb
from itertools import accumulate,groupby,permutations,combinations,product,combinations_with_replacement
from collections import deque,defaultdict,Counter
from bisect import bisect_left,bisect_right
from operator import itemgetter
from heapq import heapify,heappop,heappush
from queue import Queue,LifoQueue,PriorityQueue
from copy import deepcopy
from time import time
from functools import reduce
import string
import sys
sys.setrecursionlimit(10 ** 7)
def input() : return sys.stdin.readline().strip()
def INT()   : return int(input())
def MAP()   : return map(int,input().split())
def LIST()  : return list(MAP())

x = INT()
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):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor
from operator import mul
from functools import reduce


sys.setrecursionlimit(2147483647)
INF = 10 ** 13
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().rstrip().split()
def S(): return sys.stdin.readline().rstrip()
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 998244353


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

Solution (Python):
'''
自宅用PCでの解答
'''
import math

import itertools
import queue
import bisect
from collections import deque,defaultdict
import heapq as hpq
from sys import stdin,setrecursionlimit


ipt = stdin.readline
setrecursionlimit(10**7)
mod = 10**9+7
alp = "abcdefghijklmnopqrstuvwxyz"

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

    return None

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

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

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

Solution (Python):
import sys
from collections import deque
import numpy as np
import math
sys.setrecursionlimit(10**6)
def S(): return sys.stdin.readline().rstrip()
def SL(): return map(str,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def IL(): return map(int,sys.stdin.readline().rstrip().split())

if __name__=='__main__':
    x = I()
    if 30<=x:
        print('Yes')
    else:
        print('No')
    exit()

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

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

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

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

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

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


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

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

    return


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


def input(): return sys.stdin.readline().strip()
def I(): return int(input())
def LI(): return list(map(int, input().split()))
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def S(): return input()
def LS(): return input().split()


INF = float('inf')


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):
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):
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):
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):
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):
print(["No","Yes"][int(input()) >= 30])

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

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

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

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

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

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

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

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

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

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

Solution (Python):
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**6)
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()

x = ni()

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

Solution (Python):

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

Solution (Python):
from sys import stdin
from sys import setrecursionlimit
setrecursionlimit(10 ** 7)

n = int(stdin.readline().rstrip())

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

Solution (Python):
import sys
from collections import defaultdict, deque, Counter
import math


from bisect import bisect_left, bisect_right





input = sys.stdin.readline

getS = lambda: input().strip()
getN = lambda: int(input())
getList = lambda: list(map(int, input().split()))
getZList = lambda: [int(x) - 1 for x in input().split()]

INF = 10 ** 20
MOD = 10**9 + 7
divide = lambda x: pow(x, MOD-2, MOD)


def nck(n, k, kaijyo):
    return (npk(n, k, kaijyo) * divide(kaijyo[k])) % MOD


def npk(n, k, kaijyo):
    if k == 0 or k == n:
        return n % MOD
    return (kaijyo[n] * divide(kaijyo[n-k])) % MOD


def kaijyo(n):
    ret = [1]
    for i in range(1, n + 1):
        ret.append((ret[-1] * i)% MOD)
    return ret


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

def main():
    n = getN()
    for _ in range(n):
        solve()


if __name__ == "__main__":
    
    solve()

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

Solution (Python):

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

Solution (Python):
from collections import defaultdict
from collections import deque
from collections import Counter
import itertools
import math

def readInt():
	return int(input())
def readInts():
	return list(map(int, input().split()))
def readChar():
	return input()
def readChars():
	return input().split()

x = readInt()

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

Solution (Python):

import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from collections import deque
from functools import lru_cache
import bisect
import re
import queue
import copy
import decimal


class Scanner():
    @staticmethod
    def int():
        return int(sys.stdin.readline().rstrip())

    @staticmethod
    def string():
        return sys.stdin.readline().rstrip()

    @staticmethod
    def map_int():
        return [int(x) for x in Scanner.string().split()]

    @staticmethod
    def string_list(n):
        return [Scanner.string() for i in range(n)]

    @staticmethod
    def int_list_list(n):
        return [Scanner.map_int() for i in range(n)]

    @staticmethod
    def int_cols_list(n):
        return [Scanner.int() for i in range(n)]


def solve():
    N = Scanner.int()
    if N >= 30:
        print('Yes')
    else:
        print('No')


def main():
    
    
    solve()


if __name__ == "__main__":
    main()

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

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

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


if __name__ == '__main__':
    main()

Solution (Python):
import sys

input = sys.stdin.readline


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

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

    print(ans)


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

sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7


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


if __name__ == '__main__':
    resolve()

Solution (Python):

import os
import sys
from io import BytesIO, IOBase

BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")


from math import gcd, ceil

def pre(s):
    n = len(s)
    pi = [0] * n
    for i in range(1, n):
        j = pi[i - 1]
        while j and s[i] != s[j]:
            j = pi[j - 1]
        if s[i] == s[j]:
            j += 1
        pi[i] = j
    return pi


def prod(a):
    ans = 1
    for each in a:
        ans = (ans * each)
    return ans

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


def binary(x, length=16):
    y = bin(x)[2:]
    return y if len(y) >= length else "0" * (length - len(y)) + y


for _ in range(int(input()) if not True else 1):
    n = int(input())
    
    
    
    
    
    
    print("Yes" if n>=30 else "No")

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

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

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

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

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

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

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


if __name__ == '__main__':
    main()

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