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



Sample input:
25


Sample output:
No

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X=int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import *
from copy import *
from string import *				# alpha = ascii_lowercase
from random import *
from sys import stdin,stdout
from sys import maxsize
from operator import *				# d = sorted(d.items(), key=itemgetter(1))
from itertools import *
from collections import Counter		# d = dict(Counter(l))
import math
import math
import time
from queue import Queue
# PradeepGhosh_2017076

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())

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

Submission status: Accepted

Solution code:
x = int(input())
#a, b = map(int,input().split())
#l = list(map(int,input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
if x >= 30 :
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
N = int(input().strip())
if N>=30:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
input = stdin.readline

X = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
room_tem = int(input())

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print('Yes' if int(input())>29 else 'No')

Submission status: Accepted

Solution code:
import sys


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


sys.setrecursionlimit(20000000)

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


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys

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


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


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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input=sys.stdin.readline
num=int(input())
if num>=30:
    print("Yes")
else:print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#abc174_a

x=int(input())

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

Submission status: Accepted

Solution code:
x = float(input())
if -40 <= x <= 40 and x >= 30:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
x=int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
if n > 29:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
# Author: S Mahesh Raju
# Username: maheshraju2020
# Date: 03/08/2020

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
N = I()
if N > 29:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

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

    return X


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

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

    # 結果出力
    print(ans)


if __name__ == "__main__":
    # 標準入力を取得
    X = get_input()

    # メイン処理
    main(X)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
from collections import deque,Counter
from operator import mul
import copy
# ! /usr/bin/env python
# -*- coding: utf-8 -*-
import heapq
sys.setrecursionlimit(10**6)

X = int(input())

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
x = int(input())
if x >= 30:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
#ABC174A


X = int(input())

if X > 29:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# air conditioner
x = int(input())
if x >= 30:
	print("Yes")
else:
	print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def aircon(X):
    if X >= 30:
        print('Yes')
    else:
        print('No')

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# your code goes here
x = int(input())
if(x>=30):
	print('Yes')
else:
	print('No')

Submission status: Accepted

Solution code:
import collections



X = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())

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

Submission status: Accepted

Solution code:
X = int(input())

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

Submission status: Accepted

Solution code:
from sys import exit

# import copy
# import numpy as np
# from collections import deque

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

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

Submission status: Accepted

Solution code:
X = int(input())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#A
X=int(input())
if X>=30:
    ans='Yes'
else:
    ans='No'
    
print(ans)

Submission status: Accepted

Solution code:
X = int(input())

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

Submission status: Accepted

Solution code:
import sys
input = lambda :sys.stdin.readline().rstrip('\r\n')
print("Yes" if int(input())>=30 else "No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-


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

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

Solution code:
x=input()
x=int(x)
if -40<=x and x<=40:
    if x>=30:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
x = int(input())
if x >= 30:
  ans = "Yes"
elif x < 30:
  ans = "No"
print(ans)

Submission status: Accepted

Solution code:
# 温度の読み込み
in_data = int(input())
# 室温が 30 度以上のとき、またそのときに限り、冷房の電源を入れる。
# 冷房の電源を入れるならば Yes、入れないならば No を出力
if in_data >= 30:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

solve(int(input()))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())

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

Submission status: Accepted

Solution code:
def solve():
    print("Yes") if int(input()) >= 30 else print("No")
    return 0

if __name__ == "__main__":
    solve()

Submission status: Accepted

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

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

########################################################################################################################################################################


def dijkstra(edge,st):
    # edge=[[(v_to,dist_to_v),...],[],...]
    # initialize: def: d=dist(st,i), prev=[previous vertex in minimum path], q[]
    n=len(edge)
    d=[(0 if st==i else inf) for i in range(n)]
    q=[(j,i) for i,j in enumerate(d)]
    heapify(q)
    v=[False]*n
    # calc
    while q:
        dist,cur=heappop(q)
        if v[cur]:
            continue
        v[cur]=True
        for dst,dist in edge[cur]:
            alt=d[cur]+c[cur]
            if alt<d[dst]:
                d[dst]=alt
                heappush(q,(alt,dst))
    return d

class UnionFind:
    def __init__(self, n):
        # 負  : 根であることを示す。絶対値はランクを示す
        # 非負: 根でないことを示す。値は親を示す
        self.table = [-1] * n
 
    def _root(self, x):
        if self.table[x] < 0:
            return x
        else:
            # 経路の圧縮
            self.table[x] = self._root(self.table[x])
            return self.table[x]
 
    def find(self, x, y):
        return self._root(x) == self._root(y)
 
    def union(self, x, y):
        r1 = self._root(x)
        r2 = self._root(y)
        if r1 == r2:
            return
        # ランクの取得
        d1 = self.table[r1]
        d2 = self.table[r2]
        if d1 <= d2:
            self.table[r2] = r1
            if d1 == d2:
                self.table[r1] -= 1
        else:
            self.table[r1] = r2
    
    def __str__(self):
        rt=[i if j<0 else j for i,j in enumerate(self.table)]
        return str(rt)

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

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



show_flg=False
show_flg=True

ans=0


Yn(I()>=30)

Submission status: Accepted

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


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


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X=int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())


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

Submission status: Accepted

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

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



if __name__ == "__main__":
    main()

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# from typing import *

YES = 'Yes'
NO = 'No'

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/python3

x=int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())
def Main(X):
    return "Yes" if X >= 30 else "No"

print(Main(X))

Submission status: Accepted

Solution code:
a = int(input())

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

else:
    print ("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())
#a,b=map(int,input().split())
#a=list(map(int,input().split()))
if n>=30:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
# A - Air Conditioner
def main():
    X = int(input())
    print("Yes" if X >= 30 else "No")


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin, stdout, setrecursionlimit
from collections import deque, defaultdict, Counter
from heapq import heappush, heappop
from functools import lru_cache
import math

#setrecursionlimit(10**6)
rl = lambda: stdin.readline()
rll = lambda: stdin.readline().split()
rli = lambda: map(int, stdin.readline().split())
rlf = lambda: map(float, stdin.readline().split())

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

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

if __name__ == "__main__":
	main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A
X = int(input())
ans = 'No'
if X >= 30:
    ans = 'Yes'
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input()) 

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

Submission status: Accepted

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

MOD = 1000000007

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

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

# testcases
tc = 1
for _ in range(tc):
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import itertools
import random
from collections import deque
from decimal import *
import queue

input = sys.stdin.readline

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

inf = float('inf')
mod = 1000000007

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-

def main():
	N = inputInt()

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

	#print(N)


#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
if __name__ == "__main__":
	main()

Submission status: Accepted

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