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:
import math
# import bisect
import sys
# from collections import Counter
input = sys.stdin.readline
def inp():
	return(int(input()))
def inlt():
	return(list(map(int,input().split())))
def insr():
	s = input()
	return(s[:len(s)-1])
def invr():
	return(map(int,input().split()))
def print_fract(p,q):
	g = math.gcd(p,q)
	p//=g
	q//=g
	print(str(p)+"/"+str(q))
# list1, list2 = zip(*sorted(zip(list1, list2)))
X = inp()
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 30<= X:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
import numpy as np

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

Submission status: Accepted

Solution code:
import sys


def _i(): return int(sys.stdin.readline().strip())


def main():
    x = _i()
    return "Yes" if x >= 30 else "No"


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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
X = int(input())
if X >= 30:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
# # Make IO faster
# import sys
# input = sys.stdin.readline

# # get single (or) multiple str
# X = input()

# # get single int
# N = int(input())
# # get multiple int (e.g., 2)
# X, Y = map(int, input().split())
# # get multiple int (e.g., 2) for N lines
# XY = [list(map(int, input().split())) for _ in range(N)]

# from IPython import embed; embed(); exit();

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
 
## Library
 
import sys
from fractions import gcd
import math
from math import ceil,floor
import collections
from collections import Counter
import itertools
import copy
 
## input
 
# N=int(input())
# A,B,C,D=map(int, input().split())
# S = input()
# yoko = list(map(int, input().split()))
# tate = [int(input()) for _ in range(N)]
# N, M = map(int,input().split()) 
#    P = [list(map(int,input().split())) for i in range(M)]
#    S = []
#    for _ in range(N):
#        S.append(list(input()))
 
N=int(input())

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

Submission status: Accepted

Solution code:

import collections


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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def getN():
    return int(input())
def getNM():
    return map(int, input().split())
def getList():
    return list(map(int, input().split()))
def getArray(intn):
    return [int(input()) for i in range(intn)]
def input():
    return sys.stdin.readline().rstrip()
def rand_N(ran1, ran2):
    return random.randint(ran1, ran2)
def rand_List(ran1, ran2, rantime):
    return [random.randint(ran1, ran2) for i in range(rantime)]
def rand_ints_nodup(ran1, ran2, rantime):
  ns = []
  while len(ns) < rantime:
    n = random.randint(ran1, ran2)
    if not n in ns:
      ns.append(n)
  return sorted(ns)

def rand_query(ran1, ran2, rantime):
  r_query = []
  while len(r_query) < rantime:
    n_q = rand_ints_nodup(ran1, ran2, 2)
    if not n_q in r_query:
      r_query.append(n_q)
  return sorted(r_query)

from collections import defaultdict, deque, Counter
from sys import exit
from decimal import *
import heapq
import math
from fractions import gcd
import random
import string
import copy
from itertools import combinations, permutations, product
from operator import mul, itemgetter
from functools import reduce
from bisect import bisect_left, bisect_right

import sys
sys.setrecursionlimit(1000000000)
mod = 10 ** 9 + 7

#############
# Main Code #
#############

X = getN()

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())
print("Yes") if x > 29 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())
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():
    import sys
    def input(): return sys.stdin.readline().rstrip()
    
    x = int(input())
    if x >= 30:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines


x = int(readline())

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

Submission status: Accepted

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


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

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


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

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('Yes')

else:
    print('No')

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

def input(): return sys.stdin.readline().rstrip("\r\n")
def List(): return list(map(int, input().split()))
def Num(): return int(input())


x = Num()
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:
import sys

readline = sys.stdin.readline


def ns(): return readline().rstrip()


def ni(): return int(readline().rstrip())


def nm(): return map(int, readline().split())


def nl(): return list(map(int, readline().split()))


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

Submission status: Accepted

Solution code:
import sys
def get_array(): return list(map(int , sys.stdin.readline().strip().split()))
def get_ints(): return map(int, sys.stdin.readline().strip().split())
def input(): return sys.stdin.readline().strip()

from collections import defaultdict 
import math 

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

Submission status: Accepted

Solution code:
# A

x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ini = lambda : int(input())
inm = lambda : map(int,input().split())
inl = lambda : list(map(int,input().split()))
gcd = lambda x,y : gcd(y,x%y) if x%y else y
x = ini()
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 collections import defaultdict,deque
from sys import stdin,setrecursionlimit
import heapq,bisect,math,itertools,string,queue,copy
setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inpl(): return list(map(int, stdin.readline().split()))

X = int(input())

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

Submission status: Accepted

Solution code:
x=int(input())
if x>=30:
    print("Yes")
    exit()
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:
# int(input())
# map(int, input().split())
# list(map(int, input().split()))
# input()
# input().split()

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

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

Submission status: Accepted

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

X=int(input().rstrip('\n'))
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:
import sys
input = sys.stdin.readline
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:
import sys
import os
import itertools
import numpy as np
from collections import deque

def main():
    if os.getenv("ENV")=='LOCAL':
        sys.stdin = open(os.path.dirname(__file__)+'/input.txt', 'r')

    X=int(input())

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = int(input())

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

main()

Submission status: Accepted

Solution code:
import math
import sys
from itertools import permutations
input = sys.stdin.readline

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

x = int(input())
#b = list(map(int, input().split()))
#n, m = map(int, input().split())
#s = input()
#s,t = input().split()
#a = [int(input()) for _ in range(n)]
#
#readline = sys.stdin.readline
#n,m = [int(i) for i in readline().split()]
#ab = [[int(i) for i in readline().split()] for _ in range(n)]

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 print("No")

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
N = int(input())
if N >= 30:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
#n, m = map(int,input().split())
x = int(input())
#hl = list(map(int,input().split()))

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
T = int(input())

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

Submission status: Accepted

Solution code:
import sys
input=sys.stdin.readline
sys.setrecursionlimit(10 ** 8)
from itertools import accumulate
from itertools import permutations
from itertools import combinations
from collections import defaultdict
from collections import Counter
import fractions
import math
from collections import deque
from bisect import bisect_left
from bisect import bisect_right
from bisect import insort_left
import itertools
from heapq import heapify
from heapq import heappop
from heapq import heappush
import heapq
from copy import deepcopy
from decimal import Decimal
alf = list("abcdefghijklmnopqrstuvwxyz")
ALF = list("ABCDEFGHIJKLMNOPQRSTUVWXYZ")
#import numpy as np
INF = float("inf")
#d = defaultdict(int)
#d = defaultdict(list)
X = int(input())
if X >= 30:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input(""))
if(n>=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:
if int(input()) >= 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:
#!/usr/bin/env python3

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:
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext
# input = sys.stdin.readline 
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

def main():
    n = i_input()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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


main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys 
sys.setrecursionlimit(10**6)
MOD = 10**9+7 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(readline())
if N >= 30:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import bisect
import copy
import heapq
import math
import sys
from collections import *
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product
def input():
    return sys.stdin.readline()[:-1]
def ruiseki(lst):
    return [0]+list(accumulate(lst))
sys.setrecursionlimit(500000)
mod=pow(10,9)+7
al=[chr(ord('a') + i) for i in range(26)]
direction=[[1,0],[0,1],[-1,0],[0,-1]]

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
# Problem A - Air Conditioner
# input
X = int(input())

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

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**6)
    x = int(input())
    if x >= 30:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n=int(input())
if n>=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:
def main():

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def examA():
    X = I()
    if X<30:
        ans = "No"
    else:
        ans = "Yes"
    print(ans)
    return

def examB():
    ans = 0
    print(ans)
    return

def examC():
    ans = 0
    print(ans)
    return

def examD():
    ans = 0
    print(ans)
    return

def examE():
    ans = 0
    print(ans)
    return

def examF():
    ans = 0
    print(ans)
    return

def test():
    i = I()
    li = LI()
    lsi = LSI()
    si = LS()
    print(i)
    print(li)
    print(lsi)
    print(si)
    return

from decimal import getcontext,Decimal as dec
import sys,bisect,itertools,heapq,math,random
from copy import deepcopy
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def I(): return int(input())
def LI(): return list(map(int,sys.stdin.readline().split()))
def DI(): return dec(input())
def LDI(): return list(map(dec,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet,_ep,alphabet_convert
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
_ep = dec("0.000000000001")
alphabet = [chr(ord('a') + i) for i in range(26)]
alphabet_convert = {chr(ord('a') + i): i for i in range(26)}

getcontext().prec = 28

sys.setrecursionlimit(10**7)

if __name__ == '__main__':
    examA()

"""
142
12 9 1445 0 1
asd dfg hj o o
aidn
"""

Submission status: Accepted

Solution code:
import math
from math import gcd
INF = float("inf")

import sys
input=sys.stdin.readline
import itertools

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




if __name__=="__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import exit
import math
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

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

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

Submission status: Accepted

Solution code:
# coding: utf-8
# hello worldと表示する
#float型を許すな
#numpyはpythonで
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil,pi,factorial
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
def SI(): return input().rstrip()
def printns(x): print('\n'.join(x))
def printni(x): print('\n'.join(list(map(str,x))))
inf = 10**17
mod = 10**9 + 7

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

Submission status: Accepted

Solution code:
import copy
import math

# a = get_int()
def get_int():
    return int(input())
# a = get_string()
def get_string():
    return input()
# a_list = get_int_list()
def get_int_list():
    return [int(x) for x in input().split()]
# a_list = get_string_list():
def get_string_list():
    return input().split()
# a, b = get_int_multi()
def get_int_multi():  # a, b = get_int_multi()
    return map(int, input().split())
# a_list = get_string_char_list()
def get_string_char_list():
    return list(str(input()))
# print("{} {}".format(a, b))
# for num in range(0, a):
# a_list[idx]
# a_list = [0] * a
'''
while (idx < n) and ():

    idx += 1
'''

def main():

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys, bisect, math, itertools, string, queue, copy
import numpy as np
import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
from fractions import gcd
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

x = inp()
ans = 'No'
if x >= 30:
    ans = 'Yes'

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())

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

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

Submission status: Accepted

Solution code:
n = int(input())

ans = 0
cnt = 0
if n >= 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:
x = int(input())

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

Submission status: Accepted

Solution code:
# from pprint import pprint
# import math
# import collections

x = int(input())
# n, k = map(int, input().split(' '))
# a = list(map(int, input().split(' ')))
# a = []
# for i in range(n):
#     a.append(int(input()))


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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
import sys


inint = lambda: int(sys.stdin.readline())
inintm = lambda: map(int, sys.stdin.readline().split())
inintl = lambda: list(inintm())
instr = lambda: sys.stdin.readline()
instrm = lambda: map(str, sys.stdin.readline().split())
instrl = lambda: list(instrm())

x = inint()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#A
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:
# coding: utf-8

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

Submission status: Accepted

Solution code:
import sys
import math
import numpy as np
def I():return int(sys.stdin.readline().replace("\n",""))
def I2():return map(int,sys.stdin.readline().replace("\n","").split())
def S():return str(sys.stdin.readline().replace("\n",""))
def L():return list(sys.stdin.readline().replace("\n",""))
def Intl():return [int(k) for k in sys.stdin.readline().replace("\n","").split()]
def Lx(k):return list(map(lambda x:int(x)*-k,sys.stdin.readline().replace("\n","").split()))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

main()

Submission status: Accepted

Solution code:
def resolve():
    '''
    code here
    '''
    X = int(input())

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


if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()
# sys.setrecursionlimit(100000)


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

    return


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys, math
import io, os
#data = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
from bisect import bisect_left as bl, bisect_right as br, insort
from heapq import heapify, heappush, heappop
from collections import defaultdict as dd, deque, Counter
#from itertools import permutations,combinations
def data(): return sys.stdin.readline().strip()
def mdata(): return list(map(int, data().split()))
def outl(var) : sys.stdout.write(' '.join(map(str, var))+'\n')
def out(var) : sys.stdout.write(str(var)+'\n')
from decimal import Decimal
from fractions import Fraction
#sys.setrecursionlimit(100000)
INF = float('inf')
mod = int(1e9)+7


x=int(data())
if x>=30:
    out("Yes")
else:
    out("No")

Submission status: Accepted

Solution code:
import math

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