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

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:

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

Submission status: Accepted

Solution code:
# abc174_a.py
# https://atcoder.jp/contests/abc174/tasks/abc174_a

global FLAG_LOG
FLAG_LOG = False


def log(value):
    # FLAG_LOG = True
    FLAG_LOG = False
    if FLAG_LOG:
        print(str(value))


def calculation(lines):
    # S = lines[0]
    X = int(lines[0])
    # N, M = list(map(int, lines[0].split()))
    # values = list(map(int, lines[0].split()))
    # values = list(map(int, lines[2].split()))
    # values = list()
    # for i in range(N):
    #     values.append(int(lines[i]))
    # valueses = list()
    # for i in range(N):
    #     valueses.append(list(map(int, lines[i+1].split())))

    if X >= 30:
        result = 'Yes'
    else:
        result = 'No'

    return [result]


# 引数を取得
def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines


# テストデータ
def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['25']
        lines_export = ['No']
    if pattern == 2:
        lines_input = ['30']
        lines_export = ['Yes']
    return lines_input, lines_export


# 動作モード判別
def get_mode():
    import sys
    args = sys.argv
    global FLAG_LOG
    if len(args) == 1:
        mode = 0
        FLAG_LOG = False
    else:
        mode = int(args[1])
        FLAG_LOG = True
    return mode


# 主処理
def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    # if mode > 0:
    #     print(f'lines_input=[{lines_input}]')
    #     print(f'lines_export=[{lines_export}]')
    #     print(f'lines_result=[{lines_result}]')
    #     if lines_result == lines_export:
    #         print('OK')
    #     else:
    #         print('NG')
    # finished = time.time()
    # duration = finished - started
    # print(f'duration=[{duration}]')


# 起動処理
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 stdin

n = int(stdin.readline().rstrip())

if n > 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:
#import numpy as np
#import math
#from decimal import *
#from numba import njit

#@njit
def main():
    X = int(input())
    if X>=30:
        print('Yes')
    else:
        print('No')

main()

Submission status: Accepted

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

Submission status: Accepted

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

rl = sys.stdin.buffer.readline
INF = sys.maxsize

X = int(rl())

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

Submission status: Accepted

Solution code:
import itertools
import functools
import math
from collections import Counter
from itertools import combinations
import re

X=int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())

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

Submission status: Accepted

Solution code:
#関数リスト
import sys
input = sys.stdin.readline

def I(): return int(input())

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

Submission status: Accepted

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


flag = 1


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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

Solution code:
X = int(input())

print("Yes") if X>=30 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(1000000000)
import math
from math import gcd
def lcm(a, b): return a * b // gcd(a, b)
from itertools import count, permutations, chain, product
from functools import lru_cache
from collections import deque, defaultdict
from pprint import pprint
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
INF = float('inf')
N1097 = 10**9 + 7

def meg(f, ok, ng):
    while abs(ok-ng)>1:
        mid = (ok+ng)//2
        if f(mid):
            ok=mid
        else:
            ng=mid
    return ok

def get_inv(n, modp):
    return pow(n, modp-2, modp)

def factorials_list(n, modp):    # 10**6
    fs = [1]
    for i in range(1, n+1):
        fs.append(fs[-1] * i % modp)
    return fs

def invs_list(n, fs, modp):     # 10**6
    invs = [get_inv(fs[-1], modp)]
    for i in range(n, 1-1, -1):
        invs.append(invs[-1] * i % modp)
    invs.reverse()
    return invs

def comb(n, k, modp):
    num = 1
    for i in range(n, n-k, -1):
        num = num * i % modp
    den = 1
    for i in range(2, k+1):
        den = den * i % modp
    return num * get_inv(den, modp) % modp

def comb_from_list(n, k, modp, fs, invs):
    return fs[n] * invs[n-k] * invs[k] % modp

#

class UnionFindEx:
    def __init__(self, size):
        #正なら根の番号、負ならグループサイズ
        self.roots = [-1] * size
    def getRootID(self, i):
        r = self.roots[i]
        if r < 0:   #負なら根
            return i
        else:
            r = self.getRootID(r)
            self.roots[i] = r
            return r
    def getGroupSize(self, i):
        return -self.roots[self.getRootID(i)]
    def connect(self, i, j):
        r1, r2 = self.getRootID(i), self.getRootID(j)
        if r1 == r2:
            return False
        if self.getGroupSize(r1) < self.getGroupSize(r2):
            r1, r2 = r2, r1
        self.roots[r1] += self.roots[r2]    #サイズ更新
        self.roots[r2] = r1
        return True

Yes = 'Yes'
No = 'No'


from collections import deque

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


main()

Submission status: Accepted

Solution code:
#ABC174 A
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())
print('Yes' if 30 <= x else 'No')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# N,M = map(int,sys.stdin.readline().split())
# a = tuple(map(int,sys.stdin.readline().split())) # single line with multi param
# a = tuple(int(sys.stdin.readline()) for _ in range(N)) # multi line with single param
# a = tuple(tuple(map(int,sys.stdin.readline().rstrip().split())) for _ in range(N)) # multi line with multi param
# s = sys.stdin.readline().rstrip()
# N = int(sys.stdin.readline())
INF = float("inf")
import sys

N = int(sys.stdin.readline())

if 30 <= N:
    print("Yes")
    exit()
print("No")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 9)
# input = sys.stdin.readline    ####
def int1(x): return int(x) - 1
def II(): return int(input())
def MI(): return map(int, input().split())
def MI1(): return map(int1, input().split())
def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def MS(): return input().split()
def LS(): return list(input())
def LLS(rows_number): return [LS() for _ in range(rows_number)]
def printlist(lst, k=' '): print(k.join(list(map(str, lst))))
INF = float('inf')
# from math import ceil, floor, log2
# from collections import deque
# from itertools import combinations as comb, combinations_with_replacement as comb_w, accumulate, product, permutations
# from heapq import heapify, heappop, heappush
# import numpy as np    # cumsum
# from bisect import bisect_left, bisect_right

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

if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
# import sys
# # For getting input from input.txt file
# sys.stdin = open('input.txt', 'r')
# sys.stdout = open('output.txt', 'w')
temp = int(input())
if temp >= 30:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
import sys

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

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

Submission status: Accepted

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

import sys

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#Har har mahadev
# author : @harsh kanani

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

Submission status: Accepted

Solution code:
"""
AtCoder :: Beginner Contest 174 :: Air Conditioner
https://atcoder.jp/contests/abc174/tasks/abc174_a
"""
import sys


def main():
    """Main program."""
    temp = int(sys.stdin.readline())
    if temp >= 30:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

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

print("Yes" if tem > 29 else "No")

Submission status: Accepted

Solution code:
X = int(input())

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

Submission status: Accepted

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

X=int(input())
ans="Yes"
if X<30: ans="No"

print(ans)

Submission status: Accepted

Solution code:

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



main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import numpy as np
X = int(input())



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

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

Submission status: Accepted

Solution code:
x =int(input())
print('Yes') if x >= 30 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:
# coding: utf-8
import sys


if __name__ == "__main__":
    lines = []
    for line in sys.stdin:
        lines.append(line.rstrip('\r\n'))

    temp = int(lines[0])
    if temp >= 30:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
'''     ░░█ ▄▀█ █   █▀ █░█ █▀█ █▀▀ █▀▀   █▀█ ▄▀█ █▀▄▀█  
        █▄█ █▀█ █   ▄█ █▀█ █▀▄ ██▄ ██▄   █▀▄ █▀█ █░▀░█     '''


# [temp1.py] => [29-07-2020 @ 10:25:10] 
# Author & Template by : Udit "luctivud" Gupta
# https://www.linkedin.com/in/udit-gupta-1b7863135/


import math;   from collections import *
import sys;    from functools import reduce
import time;   from itertools import groupby

# sys.setrecursionlimit(10**6)

def input()         : return sys.stdin.readline()
def get_ints()      : return map(int, input().strip().split())
def get_list()      : return list(get_ints())
def get_string()    : return list(input().strip().split())
def printxsp(*args) : return print(*args, end="")
def printsp(*args)  : return print(*args, end=" ")


DIRECTIONS = [(+0, +1), (+0, -1), (+1, +0), (+1, -1)] 
NEIGHBOURS = [(-1, -1), (-1, +0), (-1, +1), (+0, -1),\
              (+1, +1), (+1, +0), (+1, -1), (+0, +1)]


CAPS_ALPHABETS = {chr(i+ord('A')) : i for i in range(26)}
SMOL_ALPHABETS = {chr(i+ord('a')) : i for i in range(26)}
INF = float('inf')


# Custom input output is now piped through terminal commands.
# for _test_ in range(int(input())): 
x = int(input())
print("Yes" if x >= 30 else "No")



# print("Time Elapsed: {}".format(float(S34p-S34t)))

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('YNeos'[n<30::2])

Submission status: Accepted

Solution code:
a=int(input())
ans="Yes"
if a<=29:
  ans="No"
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def function(X):
    if X < 30:
        return 'No'
    else:
        return 'Yes'


if __name__ == '__main__':
    X = int(input())
    print(function(X))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
"""AtCoder Beginner Contest 174: A - Air Conditioner
https://atcoder.jp/contests/abc174/tasks/abc174_a
"""


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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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


if __name__ == "__main__":
    main()

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


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:

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

Submission status: Accepted

Solution code:
#!/usr/bin/env pypy3
	
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 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:


def read_int():
    return int(input().strip())


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


def solve():
    if read_int() >= 30:
        return 'Yes'
    return 'No'


if __name__ == '__main__':
    print(solve())

Submission status: Accepted

Solution code:
num = int(input())
if num >= 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:
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:
import sys
from os import path

if(path.exists('input.txt')):
    sys.stdin = open("input.txt","r")
    sys.stdout = open("output.txt","w")

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

Submission status: Accepted

Solution code:
s = int(input())


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import os
import heapq
import sys,threading
import math
import bisect
import operator
from collections import defaultdict
sys.setrecursionlimit(10**5)
from io import BytesIO, IOBase
def gcd(a,b):
    if b==0:

        return a
    else:
        return gcd(b,a%b)
def power(x, p,m):
    res = 1
    while p:
        if p & 1:
            res = (res * x) % m
        x = (x * x) % m
        p >>= 1
    return res
def inar():
    return [int(k) for k in input().split()]

def lcm(num1,num2):
    return (num1*num2)//gcd(num1,num2)

def main():
    #t=int(input())
    t=1
    for _ in range(t):
        n=int(input())
        if n>=30:
            print("Yes")
        else:
            print("No")

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

if __name__ == "__main__":
    main()
    #threadin.Thread(target=main).start()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import *
from collections import *
from random import *
from bisect import *
import sys
input=sys.stdin.readline
def lis():
    return list(map(int,input().split()))
def ma():
    return map(int,input().split())
def inp():
    return int(input())
x=inp()
s='No'
if(x>=30):
    s='Yes'
print(s)

Submission status: Accepted

Solution code:
import math

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

    print(ans)
  

resolve()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
temp = int(input())
if temp >= 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:
"""
    Satwik_Tiwari ;) .
    2ND AUGUST , 2020  - SUNDAY
"""

#===============================================================================================
#importing some useful libraries.
from __future__ import division, print_function

from fractions import Fraction
import sys
import os
from io import BytesIO, IOBase

from itertools import *
import bisect
from heapq import *
from math import *
from copy import *
from collections import deque
from collections import Counter as counter  # Counter(list)  return a dict with {key: count}
from itertools import combinations as comb # if a = [1,2,3] then print(list(comb(a,2))) -----> [(1, 2), (1, 3), (2, 3)]
from itertools import permutations as permutate
from bisect import bisect_left as bl
#If the element is already present in the list,
# the left most position where element has to be inserted is returned.
from bisect import bisect_right as br
from bisect import bisect
#If the element is already present in the list,
# the right most position where element has to be inserted is returned

#==============================================================================================
#fast I/O region
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")


def print(*args, **kwargs):
    """Prints the values to a stream, or to sys.stdout by default."""
    sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", "\n"))
    if kwargs.pop("flush", False):
        file.flush()


if sys.version_info[0] < 3:
    sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
    sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)

# inp = lambda: sys.stdin.readline().rstrip("\r\n")

#===============================================================================================
### START ITERATE RECURSION ###
from types import GeneratorType
def iterative(f, stack=[]):
  def wrapped_func(*args, **kwargs):
    if stack: return f(*args, **kwargs)
    to = f(*args, **kwargs)
    while True:
      if type(to) is GeneratorType:
        stack.append(to)
        to = next(to)
        continue
      stack.pop()
      if not stack: break
      to = stack[-1].send(to)
    return to
  return wrapped_func
#### END ITERATE RECURSION ####

#===============================================================================================
#some shortcuts

mod = 1000000007
def inp(): return sys.stdin.readline().rstrip("\r\n") #for fast input
def out(var): sys.stdout.write(str(var))  #for fast output, always take string
def lis(): return list(map(int, inp().split()))
def stringlis(): return list(map(str, inp().split()))
def sep(): return map(int, inp().split())
def strsep(): return map(str, inp().split())
# def graph(vertex): return [[] for i in range(0,vertex+1)]
def zerolist(n): return [0]*n
def nextline(): out("\n")  #as stdout.write always print sring.
def testcase(t):
    for p in range(t):
        solve()
def printlist(a) :
    for p in range(0,len(a)):
        out(str(a[p]) + ' ')
def lcm(a,b): return (a*b)//gcd(a,b)
def power(a,b):
    ans = 1
    while(b>0):
        if(b%2==1):
            ans*=a
        a*=a
        b//=2
    return ans
def ncr(n,r): return factorial(n)//(factorial(r)*factorial(max(n-r,1)))
def isPrime(n) :
    if (n <= 1) : return False
    if (n <= 3) : return True
    if (n % 2 == 0 or n % 3 == 0) : return False
    i = 5
    while(i * i <= n) :
        if (n % i == 0 or n % (i + 2) == 0) :
            return False
        i = i + 6
    return True

#===============================================================================================
# code here ;))

def solve():
    n = int(inp())
    if(n>=30):
        print('Yes')
    else:
        print('No')


testcase(1)
# testcase(int(inp()))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
temp = int(input())

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
import sys
import math
sys.setrecursionlimit(int(1e6))
dprint = print
#def dprint(*args):
#   pass

x = list(map(int, input().split()))[0]
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())
ans = 'No'
if x >= 30:
    ans = 'Yes'
print(ans)

Submission status: Accepted

Solution code:
x=int(input())

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

Submission status: Accepted

Solution code:

# coding: utf-8

# In[6]:


X= int(input())


# In[7]:


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 itertools import permutations
ml=lambda:map(int,input().split())
ll=lambda:list(map(int,input().split()))
ii=lambda:int(input())
ip=lambda:list(input())
ips=lambda:input().split()

"""========main code==============="""

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

Submission status: Accepted

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

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

if __name__ == '__main__':
    main()