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


if X>=30:
  print("Yes")
else :
  print("No")
# A = list(map(int, input().split()))
# # S =[1]*N
# stock = 0 #株の数
# money = 1000 #所持金
# for i in range(N):
#   if i>0:
#     if A[i-1]<A[i]: #売る
#       money += stock*A[i]
#       stock = 0
#   if i!=N-1:
#     if A[i]<A[i+1]: #買う
#       stock += int(money/A[i])
#       money -= stock*A[i]
# print(money)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())
temp = 30

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



# 2darray [[0] * 4 for i in range(3)]
# import itertools

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
X = int(input())

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**7)
import bisect
import heapq
import itertools
import math
from collections import Counter, defaultdict, deque
from copy import deepcopy
from decimal import Decimal
from math import gcd
from operator import add, itemgetter, mul, xor
def cmb(n,r,mod):
  bunshi=1
  bunbo=1
  for i in range(r):
    bunbo = bunbo*(i+1)%mod
    bunshi = bunshi*(n-i)%mod
  return (bunshi*pow(bunbo,mod-2,mod))%mod
mod = 10**9+7
def I(): return int(input())
def LI(): return list(map(int,input().split()))
def MI(): return map(int,input().split())
def LLI(n): return [list(map(int, input().split())) for _ in range(n)]

x = I()
if x>=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:
#!/usr/bin/env python3
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("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def LI(): return list(map(int, input().split()))
def I(): return map(int, input().split())
mod = 10**9 + 7

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#=input()
x=int(input())
#=map(int,input().split())
#=map(str,input().split())
#=list(map(int,input().split()))
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:
if int(input())<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:
def main():
    X = int(input())

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# Hello World program in Python
    
n=int(input())
if(n>=30):
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

if x >= 30:
    print('Yes')
    exit()

print('No')

Submission status: Accepted

Solution code:
temp = int(input())

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
# /usr/bin/python3
# -*- coding: utf-8 -*-
from math import sqrt, floor, ceil, log10, pi
from fractions import gcd
from itertools import permutations, combinations
from operator import itemgetter
from functools import cmp_to_key


INF=1001001001
__MOD__=(10**9)+7
yn = 'YNeos'
judge = False
cnt = 0
ans = None


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

def intinput():
    return int(input())

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

def lineinputs(func=intinput):
    datas = []
    while True:
        try:
            datas.append(func())
        except EOFError:
            break
    return datas

class ModInt():
    def __init__(self, x):
        self.__x = (x % __MOD__)
    def __add__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((self.__x + other.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((self.__x + other.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")
    def __radd__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((other.__x + self.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((other.__x + self.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")

    def __sub__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((self.__x - other.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((self.__x - other.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")
    def __rsub__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((other.__x - self.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((other.__x - self.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")

    def __mul__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((self.__x * other.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((self.__x * other.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")
    def __rmul__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((other.__x * self.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((other.__x * self.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")

    def __truediv__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((self.__x * other.__modinv())%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((self.__x * other.__modinv())%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")
    def __rtruediv__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((other.__x * self.__modinv())%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((other.__x * self.__modinv())%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")

    def __pow__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__(pow(self.__x, other.__x, __MOD__)))
        elif type(other) == ModInt:
            return self.__class__(pow(self.__x, other.__x, __MOD__))
        else:
            raise Exception("Not Int or Not ModInt")
    def __rpow__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__(pow(other.__x, self.__x, __MOD__)))
        elif type(other) == ModInt:
            return self.__class__(pow(other.__x, self.__x, __MOD__))
        else:
            raise Exception("Not Int or Not ModInt")

    def __modinv(self, m=__MOD__):
        a = self.__x
        if a == 0:
            raise ZeroDivisionError()
        if gcd(a, m) != 1:
            raise Exception("%sの逆数は求まりません。" % a)
        b, u, v = m, 1, 0
        while b != 0:
            t = a//b;
            a -= t*b
            a, b = b, a
            u -= t * v
            u, v = v, u
        u %= m
        if u < 0:
            u += m
        return u
    def __int__(self):
        return self.__x
    def __str__(self):
        return str(self.__x)



if __name__ == '__main__':
    N = intinput()

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

Submission status: Accepted

Solution code:
x = int(input())
# print(x)

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

Submission status: Accepted

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

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

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:
          return print('Yes')
      else:
          return print('No')
 
main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = int(input())

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

Submission status: Accepted

Solution code:
def main(istr, ostr):
    s = int(istr.readline().strip())
    if s >= 30:
        print('Yes', file=ostr)
    else:
        print('No', file=ostr)


if __name__ == "__main__":
    import sys

    main(sys.stdin, sys.stdout)

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 30 <= n:
  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('No') if x < 30 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:
xx = int(input())

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

Submission status: Accepted

Solution code:
X = int(input())
ans = 'Yes'

if X < 30:
    ans = 'No'

print(ans)

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:
ans = "Yes" if int(input())>=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:
import sys


def resolve(in_):
    x = int(in_.read())
    return 'Yes' if x >= 30 else 'No'

def main():
    answer = resolve(sys.stdin.buffer)
    print(answer)


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:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

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

Submission status: Accepted

Solution code:
import itertools
from collections import deque,defaultdict,Counter
from itertools import accumulate
import bisect
from heapq import heappop,heappush,heapify
import math
from copy import deepcopy
import queue
import numpy as np
# sympy as syp(素因数分解とか)
Mod = 1000000007
fact = [1, 1]
factinv = [1, 1]
inv = [0, 1] 
for i in range(2, 10**5 + 1):
    fact.append((fact[-1] * i) % Mod)
    inv.append((-inv[Mod % i] * (Mod // i)) % Mod)
    factinv.append((factinv[-1] * inv[-1]) % Mod)
    
def cmb(n, r, p):
    if (r < 0) or (n < r):
        return 0
    r = min(r, n - r)
    return fact[n] * factinv[r] * factinv[n - r] % p
    
def sieve_of_eratosthenes(n):
    if not isinstance(n,int):
        raise TypeError("n is not int")
    if n<2:
        raise ValueError("n is not effective")
    prime = [1]*(n+1)
    for i in range(2,int(math.sqrt(n))+1):
        if prime[i] == 1:
            for j in range(2*i,n+1):
                if j%i == 0:
                    prime[j] = 0
    res = []
    for i in range(2,n+1):
        if prime[i] == 1:
            res.append(i)
    return res

 
class UnionFind:
    def __init__(self,n):
        self.parent = [i for i in range(n+1)]
        self.rank = [0 for i in range(n+1)]
    
    def findroot(self,x):
        if x == self.parent[x]:
            return x
        else:
            y = self.parent[x]
            y = self.findroot(self.parent[x])
            return y
    
    def union(self,x,y):
        px = self.findroot(x)
        py = self.findroot(y)
        if px < py:
            self.parent[y] = px
        else:
            self.parent[px] = py
 
    def same_group_or_no(self,x,y):
        return self.findroot(x) == self.findroot(y)
def pow_k(x, n):

    if n == 0:
        return 1

    K = 1
    while n > 1:
        if n % 2 != 0:
            K *= x
        x *= x
        n //= 2

    return K * x
def main():  #startline-------------------------------------------
    print("Yes" if int(input()) >= 30 else "No")
if __name__ == "__main__":
    main() #endline===============================================

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:
# -*- coding: utf-8 -*-
x=int(input())
if x>=30:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
input_data = int(input())
if input_data <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:
a = int(input())
if a >=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:
X = int(input())
if X <= 29:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
x = int(input())
#A = list(map(int, input().split()))
#l, r, d = map(int, input().split())

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

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

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

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

else:
    print('No')

Submission status: Accepted

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


def main():
    t = int(si())
    if t >= 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:
a = int(input())

if a >= 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:
#import numpy as np
#import collections
#import math

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import os
import sys
from io import BytesIO, IOBase
# region fastio

BUFSIZE = 8192

class FastIO(IOBase):
    newlines = 0

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

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

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

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


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


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

# ------------------------------

def RL(): return map(int, sys.stdin.readline().rstrip().split())
def RLL(): return list(map(int, sys.stdin.readline().rstrip().split()))
def N(): return int(input())
def comb(n, m): return factorial(n) / (factorial(m) * factorial(n - m)) if n >= m else 0
def perm(n, m): return factorial(n) // (factorial(n - m)) if n >= m else 0
def mdis(x1, y1, x2, y2): return abs(x1 - x2) + abs(y1 - y2)
def toord(c): return ord(c)-ord('a')
def lcm(a, b): return a*b//lcm(a, b)
mod = 998244353
INF = float('inf')
from math import factorial, sqrt, ceil, floor, gcd
from collections import Counter, defaultdict, deque
from heapq import heapify, heappop, heappush


# ------------------------------
# f = open('./input.txt')
# sys.stdin = f

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
T = int(input())

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 標準入力を取得
X = int(input())

# 求解処理
ans = str()
if X >= 30:
    ans = "Yes"
else:
    ans = "No"

# 結果出力
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
temp = int(input())

if(30 <= temp):
  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:
n  = int(input())
if n >= 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:
x=int(input())
print('YNeos'[x<30::2])

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    a = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c = int(input())
if c >= 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:
X = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=int(input())

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

if i >= 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:
if 30 <= int(input()):
    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())

cond = x >= 30

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
temp = int(input())

if 30 <= temp:
    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:
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:
if int(input()) >= 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())
#a, b = map(int, input().split())
#a = list(map(int, input().split()))
#a = [list(map(int, input().split())) for i in range(n)]

if int(input())>=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:
#!/usr/bin/python
# -*- coding: UTF-8 -*-

import sys


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


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
import bisect
from functools import lru_cache
from collections import defaultdict
inf = float('inf')
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**6)
def input(): return sys.stdin.readline().rstrip()
def read():
  return int(readline())
def reads():
  return map(int, readline().split())
X=read()
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
import os
# import math
# input = sys.stdin.readline

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


def str_array():
    return input().strip().split()

def gcd(a,b):
    if b == 0:
        return a
    return gcd(b, a % b);x

def take_input():
	if os.environ.get("check"):
		sys.stdin = open('input.txt', 'r') 
		sys.stdout = open('output.txt', 'w')
		
take_input()
######################### TEMPLATE ENDS HERE #################################

n = int(input())
if n >= 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("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:
# 2020/08/02
# AtCoder Beginner Contest 174 - A

# Input
x = int(input())

# Calc
if x >= 30:
    ans = 'Yes'
else:
    ans = 'No'

# Output
print(ans)

Submission status: Accepted

Solution code:
from sys import stdin


def readline_from_stdin() -> str:
    return stdin.readline().rstrip


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

Submission status: Accepted

Solution code:
import sys
def Ii():return int(sys.stdin.readline())
def Mi():return map(int,sys.stdin.readline().split())
def Li():return list(map(int,sys.stdin.readline().split()))
x = Ii()
if x >= 30:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# cook your dish here
x = int(input())
if x>=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:
cmp = int(input())
if 30 <= cmp:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

import sys
import math


debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        for line in sys.stdin:
            lines.append(line.strip())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]

    x = int(lines[0])
    

    return (x, )


def solve(x):

    result = 'No'
    if x >= 30:
        result = 'Yes'
        
    return result
    


def main():
    # 出力
    result = solve(*parse_input())
    if isinstance(result, list):
        for r in result:
            print("%s" % r, sep='')
    else:
        print("%s" % result, sep='')

if __name__ == '__main__':

    main()