Problem:
 Score : 100 points    Problem Statement You will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above.  The current temperature of the room is X degrees Celsius. Will you turn on the air conditioner?      Constraints  -40 \leq X \leq 40  X is an integer.         Input Input is given from Standard Input in the following format:  X       Output Print Yes if you will turn on the air conditioner; print No otherwise.        Sample Input 1 25      Sample Output 1 No       Sample Input 2 30      Sample Output 2 Yes

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

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

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

"""
Created on Fri Aug  7 01:24:25 2020

@author: saito
"""






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

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

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

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

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

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

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

def main():
    mod=10**9+7
    X=I()
    if X>=30:
        print("Yes")
    else:
        print("No")

main()

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


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("YNeos"[not(X>=30)::2])

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

Solution (Python):
X = int(input())
print("YNeos"[not(X>=30)::2])

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):
import sys
sys.setrecursionlimit(10**6)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
x = int(input())
res = x > 29 and 'Yes' or 'No'
print(res)

Solution (Python):
a = int(input())
res = a > 29 and 'Yes' or 'No'
print(res)

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

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

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

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

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

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

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

Solution (Python):

X = int(input())

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
print('Yes' if 30<=int(input()) 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("Yes" if int(input())>=30 else "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())
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())
for a in range(100000000):
  a=2*2
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
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
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):
x = int(input())
if (x >= 30):
    print('Yes')
else:
    print('No')

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

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

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

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

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

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

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

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 math import *
from copy import *
from string import *				
from random import *
from sys import stdin,stdout
from sys import maxsize
from operator import *				
from itertools import *
from collections import Counter		
import math
import math
import time
from queue import Queue


def seive(n):
	l=[True]
	l=l*(n+1)
	for i in range(2,int(sqrt(n))+1):
		if(l[i]==True):
			val=i*i
			while(val<len(l)):
				l[val]=False
				val+=i
	prime=[]
	for i in range(2,len(l)):
		if(l[i]==True):
			prime.append(i)
	return prime

def dp(l,i,n,val,ans):
	if(i>=n or val<0):
		return 1000000
	elif(val==0):
		return 0
	else:
		if(ans[i]==1000000):
			ans[i]=min(min(1+dp(l,i+1,n,val-l[i],ans),1+dp(l,i,n,val-l[i],ans)),dp(l,i+1,n,val,ans))
		return ans[i]
from queue import Queue
def factors(n):
	l=[]
	for i in range(1,int(sqrt(n))+1):
		if(n%i==0):
			if(n//i==i):
				l.append(i)
			else:
				l.append(i)
				l.append(n//i)
	return l
def check1(s,v,x):
	while(True):
		if(v not in s):
			return v
		else:
			v-=1
def check2(s,v,x):
	while(True):
		if(v not in s):
			return v
		else:
			v+=1

def up(n):
	j=n-1
	while(j>0):
		if(n%j==0):
			break
		j-=1
	return j		
def fac(n):
	c=1
	i=1
	while(i<=n):
		c*=i
		i+=1
	return c
def check_happy(n):
	ss=set()
	print(n)
	while(n!=1):
		val=n
		s=0
		print(val)
		while(val!=0):
			s+=(val%10)**2
			val=val//10
		print(val)
		print("hi")
		if(val in ss):
			return False
		else:
			n=val
			ss.add(n)
	return True
def update(a,b):
	c=1
	val=a
	while(a<b):
		print(c,a)
		c+=c
		a+=a
	print(1)
	while(a>b):
		print()
		a-=val
		c-=1
	return c
import random as rand
def gcd(a,b): 
    if a == 0: 
        return b 
    return gcd(b % a, a) 

from itertools import permutations
def insertion_sort(arr):
	for i in range(len(arr)):
		j=i
		while(j>0):
			if(arr[j]<arr[j-1]):
				temp=arr[j]
				arr[j]=arr[j-1]
				arr[j-1]=temp
			j-=1
	return arr
def quick_sort(arr,low,high):
	i=low
	j=high
	
	while(i<j):
		if(arr[i]>arr[low] and arr[j]<arr[low]):
			temp=arr[i]
			arr[i]=arr[j]
			arr[j]=arr[i]
			i+=1
			j-=1
		elif(arr[i]<=arr[low]):
			i+=1
		elif(arr[j]>=arr[low]):
			j-=1
	print(i,j)
	toto=arr[j]
	arr[j]=arr[low]
	arr[low]=toto
	return j
def dodo(arr,low,high):
	if(low<high):
		val=quick_sort(arr,low,high)
		dodo(arr,low,val-1)
		dodo(arr,val+1,high)
def dp(arr,c,n,k,z,ans):
	if(k==0):
		return ans
	else:
		if(c==0):
			return dp(arr,c+1,n,k-1,z,ans+arr[c+1])
		elif(c==n-1):
			if(z==0):
				return 0
			else:
				return dp(arr,c-1,n,k-1,z-1,ans+arr[c-1])
		else:
			if(z==0):
				return dp(arr,c+1,n,k-1,z,ans+arr[c+1])
			else:
				return max(dp(arr,c+1,n,k-1,z,ans+arr[c+1]),dp(arr,c-1,n,k-1,z-1,ans+arr[c-1]))
if __name__ == '__main__':
	n=int(input())
	if(n>=30):
		print("Yes")
	else:
		print("No")

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

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

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

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

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

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().strip())
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):
from sys import stdin
input = stdin.readline

X = int(input())

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

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

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

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

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

Solution (Python):
a = list(map(int, input().split()))
if a[0] >= 30:
  print("Yes")
else:
  print("No")

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

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

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