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

Solution (Python):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin, log, log10, gcd
from itertools import permutations, combinations, product, accumulate, combinations_with_replacement
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits

from decimal import *
import heapq
def debug(*args):
    if debugmode:
        print(*args)
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def FLOAT(): return float(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7
dx = [0, 1, 0, -1, 1, -1, -1, 1]
dy = [1, 0, -1, 0, 1, -1, 1, -1]
debugmode = True

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

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

Solution (Python):
import sys
input=sys.stdin.readline

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

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

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

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

Solution (Python):
N = int(input())

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
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 LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

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

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

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

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 8)

input = sys.stdin.readline


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


if __name__ == '__main__':
    main()

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

Solution (Python):

import sys
sys.setrecursionlimit(10**8)
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return [LIST() for _ in range(n)]
def NSTR(n): return [input() for _ in range(n)]


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


def main():
    X = INT()
    if 30 <= X:
        print("Yes")
    else:
        print("No")

    return


if __name__ == '__main__':
    main()

Solution (Python):
print("YNeos"[int(input())<30::2])

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

Solution (Python):
N = int(input())

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

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

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

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

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

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

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

X = INT()

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

Solution (Python):
import sys, os, math, bisect, itertools, collections, heapq, queue, copy, array





sys.setrecursionlimit(10000000)

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: (x * y) // math.gcd(x, y)

MOD = 10 ** 9 + 7
MAX = float('inf')


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

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


if __name__ == '__main__':
    main()

Solution (Python):
import sys, math
from functools import lru_cache
from collections import defaultdict
sys.setrecursionlimit(500000)
MOD = 10**9+7

def input():
    return sys.stdin.readline()[:-1]

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

def ii():
    return int(input())

def i2(n):
    tmp = [list(mi()) for i in range(n)]
    return [list(i) for i in zip(*tmp)]


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

if __name__ == '__main__':
    main()

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

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

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

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

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

Solution (Python):

import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

X=int(input())
YesNo(X>=30)

Solution (Python):


import sys
input=sys.stdin.readline

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

Solution (Python):
from collections import defaultdict,deque
def main():
    n = int(input())
    if(n>=30):
        print("Yes")
    else:
        print("No")
if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
import sys
input = lambda: sys.stdin.readline().rstrip('\r\n')

X = int(input())

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

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

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

Solution (Python):



from fractions import gcd
from itertools import combinations,permutations,accumulate 

from collections import deque,defaultdict,Counter
import decimal
import re












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

def readInts():
  return list(map(int,input().split()))
def I():
  return int(input())
x = I()
print('Yes' if x >= 30 else 'No')

Solution (Python):
from sys import stdin
from sys import setrecursionlimit
from collections import Counter, deque, defaultdict
from math import floor, ceil
from bisect import bisect_left
from itertools import combinations
setrecursionlimit(100000)

INF = int(1e10)
MOD = int(1e9 + 7)

def main():
    from builtins import int, map
    X = int(input())
    if X >= 30:
        print("Yes")
    else:
        print("No")

if __name__ == '__main__':
    main()

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

Solution (Python):

from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

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


if __name__ == "__main__":
    solve()

Solution (Python):
import bisect
import cmath
import heapq
import itertools
import math
import operator
import os
import random
import re
import string
import sys
from collections import Counter, defaultdict, deque
from copy import deepcopy
from decimal import Decimal
from functools import lru_cache, reduce
from math import gcd
from operator import add, itemgetter, mul, xor

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

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



x = int(sys.stdin.buffer.readline())
if x >= 30:
    print('Yes')
else:
    print('No')

Solution (Python):
a = int(input())

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

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