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:
mod = 1000000007
eps = 10**-9


def main():
    import sys
    input = sys.stdin.readline

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3


def main():
    import sys

    input = sys.stdin.readline

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from sys import stdin
n = int(stdin.readline().rstrip())
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())

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

Submission status: Accepted

Solution code:
# for #!/usr/bin/env python
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")

# endregion
class union_find:
    def __init__(self, n):
        self.n = n
        self.rank = [0]*n
        self.parent = [int(j) for j in range(n)]
    
    def union(self,i,j):
        i = self.find(i)
        j = self.find(j)
        if self.rank[i] == self.rank[j]:
            self.parent[i] = j
            self.rank[j] += 1

        elif self.rank[i] > self.rank[j]:
            self.parent[j] = i
        else:
            self.parent[i] = j

    def find(self, i):
        temp = i
        if self.parent[temp] != temp:
            self.parent[temp] = self.find(self.parent[temp])
        return self.parent[temp]
from math import log2, ceil
def main():
# Enter your code here. Read input from STDIN. Print output to STDOUT
    # for t in range(int(input())):
        n = int(input())
        # n,k  =[int(j) for j in input().split()]
        if(n>=30):
            print("Yes")
        else:
            print("No")

        # print(m)
        


        # n,k,z  =[int(j) for j in input().split()]
        



if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# AtCoder Beginner Contest 174
# 


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:
def main():
    X = int(input())
    return X >= 30

print('Yes' if main() else 'No')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
from collections import defaultdict as D
from functools import reduce
import numpy as np
from numba import njit
import sys
sys.setrecursionlimit(10**7)

def _S(): return sys.stdin.readline().rstrip()
def I(): return int(_S())
def LS(): return list(_S().split())
def LI(): return list(map(int,LS()))

X = I()
if X >= 30:
    ans = True
else:
    ans = False

if ans:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
# Coding is about expressing your feeling and there is always a better way to express your feeling _feelme
import sys,math,numpy as np
#sys.stdin,sys.stdout=open('input.txt','r'),open('output.txt','w')
from sys import stdin,stdout;mod=int(1e9 + 7);from statistics import mode
from collections import *;from math import ceil,floor,inf,factorial,gcd,log2,sqrt
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()
# print('{:.3f}'.format(1),round(1.123456789,4))
# np.set_printoptions(sign=' ',legacy='1.13') # legacy add space at sign position
# sys.setrecursionlimit(500000)
def lcm(a,b): return (a*b)//gcd(a,b)
def setbits(n):return bin(n).count('1')
def resetbits(n):return bin(n).count('0')
def modinv(n,p):return pow(n,p-2,p)
def ncr(n,r):
    num,den=1,1;r=min(n,n-r)
    for i in range(r):num*=(n-i);den*=(i+1)
    return num//den
def ncr_p(n, r, p):
    num,den=1,1;r=min(r,n-r)
    for i in range(r):num = (num * (n - i)) % p ;den = (den * (i + 1)) % p
    return (num * modinv(den,p)) % p
def isPrime(num) :
    if num<=1:return False
    if num==2 or n==3:return True
    if (num % 2 == 0 or num % 3 == 0) :return False
    m = int(num**0.5)+1
    for i in range(5,m,6):
        if (num % i == 0 or num % (i + 2) == 0) :return False
    return True
def bin_search(arr, low, high, val):
    while low <= high:
        mid = low + (high - low) // 2;
        if arr[mid] == val:return mid
        elif arr[mid] < val:low = mid + 1
        else:high = mid - 1
    return -1
def sumofdigit(num):
    count=0;
    while num : count+=num % 10;num //= 10;
    return count;
def inputmatrix():
    r,c=iia();mat=[0]*r;
    for i in range(r):mat[i]=iia();
    return r,c,mat;
def prefix_sum(n,arr):
    for i in range(1,n):arr[i]+=arr[i-1]
    return arr;
def binomial(n, k):
    if 0 <= k <= n:
        ntok = 1;ktok = 1
        for t in range(1, min(k, n - k) + 1):ntok *= n;ktok *= t;n -= 1
        return ntok // ktok
    else:return 0
def divisors(n):
    res = [];
    for i in range(1,ceil(sqrt(n))+1):
        if n%i == 0:
            if i==n//i:res.append(i)
            else:res.append(i);res.append(n//i)
    return res;


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

Submission status: Accepted

Solution code:
import sys
import math
from collections import Counter
import heapq
try:
    for _ in range(1):
        x=int(input())
        if x>=30:
            print("Yes")
        else:
            print("No")
        
except:
    pass

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 >= 30 else "No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inp=int(input())
if inp>=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:
n=int(input())
if 30<=n:
    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:
#A

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
X = int(input())

if X >= 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:
# coding: utf-8
# Your code here!
import sys
readline = sys.stdin.readline
read = sys.stdin.read

x, = [int(i) for i in read().split()]

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sun Aug  2 20:59:32 2020

@author: NEC-PCuser
"""

X = int(input())

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("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:

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

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

Submission status: Accepted

Solution code:
import math
num = int(input())
answer = "No"
if num >= 30:
    answer = "Yes"
print(answer)

Submission status: Accepted

Solution code:
"""
    こんにちは。これはクシャルです
    
    Author : thekushalghosh (クシャル)
    Team   : CodeDiggers
 
    I prefer Python language over the C++ language :p :D
        
    Visit my website : thekushalghosh.github.io
"""
import sys,math,cmath,time
start_time = time.time()
##########################################################################
################# ---- THE ACTUAL CODE STARTS BELOW ---- #################
    
def solve():
    n = inp()
    if n >= 30:
        print("Yes")
    else:
        print("No")
    
################## ---- THE ACTUAL CODE ENDS ABOVE ---- ##################
##########################################################################
 
def main():
    global tt
    if not ONLINE_JUDGE:
        sys.stdin = open("input.txt","r")
        sys.stdout = open("output.txt","w")
    t = 1
    for tt in range(t):
        solve()
    if not ONLINE_JUDGE:
        print("Time Elapsed :",time.time() - start_time,"seconds")
        sys.stdout.close()
    
#---------------------- USER DEFINED INPUT FUNCTIONS ----------------------#
def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split())))
def insr():
    return(input().strip())
def invr():
    return(map(int,input().split()))
 
#------------------ USER DEFINED PROGRAMMING FUNCTIONS ------------------#
def counter(a):
    q = [0] * max(a)
    for i in range(len(a)):
        q[a[i] - 1] = q[a[i] - 1] + 1
    return(q)

def counter_elements(a):
    q = dict()
    for i in range(len(a)):
        if a[i] not in q:
            q[a[i]] = 0
        q[a[i]] = q[a[i]] + 1
    return(q)

def string_counter(a):
    q = [0] * 26
    for i in range(len(a)):
        q[ord(a[i]) - 97] = q[ord(a[i]) - 97],1
    return(q)
 
def factors(n):
    q = []
    for i in range(1,int(n ** 0.5) + 1):
        if n % i == 0: q.append(i); q.append(n // i)
    return(list(sorted(list(set(q)))))
 
def prime_factors(n):
    q = []
    while n % 2 == 0: q.append(2); n = n // 2
    for i in range(3,int(n ** 0.5) + 1,2):
        while n % i == 0: q.append(i); n = n // i
    if n > 2: q.append(n)
    return(list(sorted(q)))

def transpose(a):
    n,m = len(a),len(a[0])
    b = [[0] * n for i in range(m)]
    for i in range(m): 
        for j in range(n): 
            b[i][j] = a[j][i]
    return(b)

#-----------------------------------------------------------------------#
ONLINE_JUDGE = __debug__
if ONLINE_JUDGE:
    input = sys.stdin.readline
main()

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

Submission status: Accepted

Solution code:
# coding: utf-8

import math
import re
import numpy as np
import copy

#読み込む
X = int(input())

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

Submission status: Accepted

Solution code:
import sys
import copy
from collections import deque
import collections
stdin = sys.stdin

mod = 10**9+7

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  # ignore trailing spaces

x = ni()

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:
#<100q.saitabbkeiro>
#<56>
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:
import sys
input = sys.stdin.readline
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:
X = int(input())

ans = ""

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

print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import collections as cl
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()))


def main():
    N = II()
    if N >= 30:
        print("Yes")
        return

    print("No")


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())
#N, M = map(int, input().split())
# a,b=map(int, input().split())  #複数数値入力　「A B」みたいなスペース空いた入力のとき
# c=list(map(int, input().split()))  #リスト入力 「a1 a2 a3 ...」みたいな配列のような入力のとき
# s=[list(map(int,list(input()))) for i in range(h)]  # 二次元配列入力　二次元マップみたいな入力の

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

Submission status: Accepted

Solution code:
d = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
import os
import sys
from io import BytesIO, IOBase


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

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

# endregion

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
#codiing:utf-8

x = int(input())

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

Submission status: Accepted

Solution code:
s = [input() for i in range(1)] 
s0 = int(s[0])
if s0 >= 30:
    print("Yes")
if s0 < 30:
    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:
def resolve():
  X = int(input())

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

if __name__ == "__main__":
  resolve()

Submission status: Accepted

Solution code:
def _run(x):
    if 30 <= x:
        print("Yes")
    else:
        print("No")

def _main():
    X = int(input())
    _run(X)


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

Submission status: Accepted

Solution code:
X = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#Problem 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:
x = int(input())

ans = 'Yes' if x >=30 else 'No'

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = float(input())

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

Submission status: Accepted

Solution code:
##a = int(stdin.readline().rstrip())
##b, c = [int(x) for x in stdin.readline().rstrip().split()]
##s = stdin.readline().rstrip()
##a = list(set(b))  重複を削除
##a = list(map(int,[int(x) for x in stdin.readline().rstrip().split()])) a[0, 1, 2, ...]
##a = [[0] * 2 for _ in range(n)]  a[0,0]
##v = [s[i: i+2] for i in range(0, len(s), 2)]
##  s="12345678" を v=["12","34","56","78"] にするイメージ
##s = "".join(list)リストを文字列に変換[""]は区切り文字
##a.sort(key=itemgetter(1))リストをソートできるよ(from operator import itemgetterが必要)
##sort_p = sorted(p) 昇順ソート

# -*- coding: utf-8 -*-
from sys import stdin
from operator import itemgetter
from collections import deque, Counter
import math
import pprint
from functools import reduce
import numpy as np
import random
import bisect
import copy
# stdin = open("sample.txt")


MOD = 1000000007
INF = float('inf')
alpha = ["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]

def keta(kazu): # 入力されたintを桁ごとに分解，リストで出力
    kazu_str = str(kazu)
    kazu_list = [int(kazu_str[i]) for i in range(0, len(kazu_str))]
    return kazu_list

def gcd(*numbers): # 最小公倍数
    return reduce(math.gcd, numbers)

def combination(m,n): # mCn
    
    if n > m:
        return 'すまん'
    return math.factorial(m) // (math.factorial(m-n) * math.factorial(n))

def pow_k(x,n):  # (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 fact(n): # nの素因数分解の結果を辞書で出力 fuct(24) → {2: 3, 3: 1}
    arr = {}
    temp = n
    for i in range(2,int(n**0.5)+1):
        if temp % i == 0:
            cnt = 0
            while temp % i == 0:
                cnt += 1
                temp //= i
            arr[i] = cnt
    if temp != 1:
        arr[temp] = 1
    if arr == {}:
        arr[n] = 1
    return arr
    
def main():
    a = int(stdin.readline().rstrip())
    if a >= 30:
        print("Yes")
    else:
        print("No")
main()

Submission status: Accepted

Solution code:
print('Yes' if 30 <=int(input()) else '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/env python3
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:
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")
    
    
if __name__ == "__main__":
    main()

Submission status: Accepted

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

# In[1]:


X = int(input())


# In[2]:


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


# In[ ]:

Submission status: Accepted

Solution code:
from sys import stdin


def main():
    _in = [_.rstrip() for _ in stdin.readlines()]
    X = int(_in[0])  # type:int
    # vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv
    ans = 'Yes' if X >= 30 else 'No'
    # ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
    print(ans)


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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
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")


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:
import math
import sys
import bisect
input=sys.stdin.readline
#t=int(input())
t=1
for _ in range(t):
    n=int(input())
    #n,k=map(int,input().split())
    #l=list(map(int,input().split()))
    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:
import sys
sys.setrecursionlimit(10**8)
stdin = sys.stdin


def ni(): return int(ns())


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


def naa(N): return [na() for _ in range(N)]


def ns(): return stdin.readline().rstrip()  # ignore trailing spaces


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

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())
# lis=list(map(int,input().split))
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:
N = int(input())
A ='Yes'
if N < 30:
    A = 'No'
print(A)

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(30<=x):
    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:
# 初期入力
import sys
#input = sys.stdin.readline  #文字列では使わない
X = int(input())
if X >=30:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import sys
import bisect
import itertools
import collections
import fractions
import heapq
import math
from operator import mul
from functools import reduce
from functools import lru_cache


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    X = int(input())
    if X >= 30:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
t=int(input())

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

Submission status: Accepted

Solution code:
import sys
from io import StringIO
import unittest
import os

# 再帰処理上限(dfs作成時に設定するのが面倒なので限度近い値を組み込む)
sys.setrecursionlimit(999999999)


# 実装を行う関数
def resolve(test_def_name=""):
    x = int(input())

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


# テストクラス
class TestClass(unittest.TestCase):
    def assertIO(self, assert_input, output):
        stdout, sat_in = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(assert_input)
        resolve(sys._getframe().f_back.f_code.co_name)
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, sat_in
        self.assertEqual(out, output)

    def test_input_1(self):
        test_input = """25"""
        output = """No"""
        self.assertIO(test_input, output)

    def test_input_2(self):
        test_input = """30"""
        output = """Yes"""
        self.assertIO(test_input, output)

    # 自作テストパターンのひな形(利用時は「tes_t」のアンダーバーを削除すること
    def tes_t_1original_1(self):
        test_input = """データ"""
        output = """データ"""
        self.assertIO(test_input, output)


# 実装orテストの呼び出し
if __name__ == "__main__":
    if os.environ.get("USERNAME") is None:
        # AtCoder提出時の場合
        resolve()

    else:
        # 自PCの場合
        unittest.main()

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
import sys

N = int(sys.stdin.readline().strip())
print("Yes" if N >= 30 else "No")

Submission status: Accepted

Solution code:
N=input()
if 30<=N:
    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:
# -*- coding: utf-8 -*-

n = int(input())

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

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