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: Runtime Error

Solution code:
N = int(input())
c= list(input()) 
if c.count('R') == N:
	print(0)
	exit()
div=0
addcnt = 0
if N %2 == 1:
	div =1
	Q = c[int(N/2)]
	# print(Q)
	if Q == 'W':
		addcnt +=1
		# print('QQQ!')
clist_L = c[:int(N/2)]
clist_R = c[int(N/2)+div:]
Lcnt = clist_L.count('W')
Rcnt = clist_R.count('R')
if Lcnt - Rcnt <=0:
	print(Rcnt-addcnt)
else:
	print(Lcnt-Rcnt+addcnt)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
X = int(input())
X = range(-40 < 40)
if X > 30:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
X = input()
X = range(-40,40)
if X > 30:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
n=int(input())
s=input()

rcount=s.count("R")
num=s[0:rcount]
rnum=num.count("R")



print(rcount-rnum)

Submission status: Runtime Error

Solution code:
N = int(input())
C = list(input())
N1 = int(N/2)
C1 = C[0:N1]
C2 = C[N1:N]
count = 0
if (C1.count('W') == C2.count('R')):   #左右対象のとき
    count = C1.count('W')
elif(C1.count('R') == C2.count('W')):
    count = C.count('W')
print(count)

Submission status: Runtime Error

Solution code:
t = int(input()):

if 30 <= t <=40 :
 print("Yes")
if -40 <= t < 30:
  print("No")

Submission status: Runtime Error

Solution code:
column = list(map(int, input().split(" ")))
N, D = column[0], column[1]
count = 0
for i in range(1, N+1):
  X, Y=column[2*i], column[2*i+1]
  if X^2 + Y^2 <= D^2:
    count += 1
print(count)

Submission status: Runtime Error

Solution code:
import numpy as np
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()))

N,Q = LI()
_c = LI()
_lr = [LI() for _ in range(Q)]
lr = np.array(_lr)
c = np.zeros(N + 1)
c[1:] = _c

for pair in lr:
    print(len(set(c[pair[0]:pair[1]+1])))

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

Solution code:
int t=in(input("");
if(t<30)
System.out.println("No");
else
System.out.println("Yes");

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#####segfunc######
def segfunc(x,y):
    return x | y

def init(init_val):
    #set_val
    for i in range(n):
        seg[i+num-1]=set([init_val[i]])  
    #built
    for i in range(num-2,-1,-1) :
        seg[i]=segfunc(seg[2*i+1],seg[2*i+2]) 
    
def update(k,x):
    k += num-1
    seg[k] = x
    while k:
        k = (k-1)//2
        seg[k] = segfunc(seg[k*2+1],seg[k*2+2])
    
def query(p,q):
    if q<=p:
        return ide_ele
    p += num-1
    q += num-2
    res=ide_ele
    while q-p>1:
        if p&1 == 0:
            res = segfunc(res,seg[p])
        if q&1 == 1:
            res = segfunc(res,seg[q])
            q -= 1
        p = p//2
        q = (q-1)//2
    if p == q:
        res = segfunc(res,seg[p])
    else:
        res = segfunc(segfunc(res,seg[p]),seg[q])
    return res

#####単位元######
ide_ele = set()

#num:n以上の最小の2のべき乗

n, Q = map(int, input().split())

num =2**(n-1).bit_length()
seg=[ide_ele]*2*num

c = list(map(int,input().split()))
init(c)
for _ in range(Q):
    l, r = map(int, input().split())
    ans = query(l-1,r)
    print(len(ans))

Submission status: Runtime Error

Solution code:
if x >= 30 :
  print('Yes')
 else {
   x < 30 :
   print('No') 
 }

Submission status: Runtime Error

Solution code:
if X<29:
  print('No')
else:
  print('Yes')

Submission status: Runtime Error

Solution code:
k = int(input())

def f(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])
    if arr==[]:
        arr.append([n, 1])
    return arr
u = f(k)

def yakusu(n):
    u = [n]
    i = 2
    while i <= n/2:
        if n%i == 0:
            u.append(i)
        i += 1
    return sorted(list(u))

v = yakusu(k-1)
del v[-1]

if k==1:
    print(1)
elif k%2==0 or len(u)>1:
    print(-1)
else:
    for i in v:
        if int('7'*i)%k==0:
            print(i)
            break
    else:
        print(k-1)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
X = int()
 -40 <= X <= 40
def Air_Conditioner():
    if -40 <= X < 30:
        return "No"
    elif 30 <= X <= 40:
        return "Yes"

Air_Conditioner()

Submission status: Runtime Error

Solution code:
x, y = [list(i) for i in zip(*xy)]
N, D = x[0], y[0]
count = 0
for i in range(1, N+1):
	X, Y=x[i], y[i]
    if X^2+Y^2 <= D^2:
    	count += 1
    else:
    	pass
print(count)

Submission status: Runtime Error

Solution code:
import math
i = 1
z = 0
t = 0
n, d = map(int, input().split())
while i <= n:
    i += 1
    a, b = map(int, input().split())
    if math.sqrt(a**2 + b**2) <= d:
        t += 1

print(t)

Submission status: Runtime Error

Solution code:
X = int(input())
if(X => 30):
  print('True')
else:
  print('False')

Submission status: Runtime Error

Solution code:
def aux(x):
    while 29<x>=30:
        return'Yes'
    return 'No

Submission status: Runtime Error

Solution code:
import math

#N行,距離D
N,D = map(int, input().split())

num_list = []
for i in range(N):
    num_list.append(list(map(int,input().split())))

count = 0
for p,q in num_list:
  d = math.sqrt(p**2 + q**2)
  if(d<=D):
    count += 1
    
print(count)

Submission status: Runtime Error

Solution code:
k = int(input())

if k == 7:
    ans = 1
elif k % 2 == 0:
    ans = -1
else:
    for i in range(1, (len(str(k)) * 3) + 1):
        tgt = int("7" * i)
        if tgt % k == 0:
            ans = i
            break

print(ans)

Submission status: Runtime Error

Solution code:
val = input()

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

Submission status: Runtime Error

Solution code:
while -40<=int(input())<=40: print('yes')
print('no')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
X=input()

if (X>40 or X<-40):
  return 0
elif(X=>30 and X=<40):
  print('Yes')
elif(X=>-40 and X<30)
  print('No')

Submission status: Runtime Error

Solution code:
x=input()
X=int(x)
if (X>40||X<-40):
  return 0
elif(X=>30&&X=<40):
  print('Yes')
elif(X=>-40&&X<30):
  print('No')

Submission status: Runtime Error

Solution code:
while -40<=int(input())<=40:
    print('yes')
print('no')

Submission status: Runtime Error

Solution code:

X=input()

if (X>40||X<-40):
  return 0
elif(X=>30&&X=<40):
  print('Yes')
elif(X=>-40&&X<30)
  print('No')

Submission status: Runtime Error

Solution code:
import math
N, D = map(int, input().split())
l = [list(map(int, input().split())) for l in range(N)]
 
ans=0
for i,a in enumerate(l):
    if math.sqrt(a[0]**2 + a[1]**2)<=D:
        ans+=1
ans

Submission status: Runtime Error

Solution code:
from math import sqrt
N, D = map(int, input().split())
count = 0
for i in range(N):
    P, Q = map(int, input().split())
    dis = ((P**2)+(Q**2))**0.5
    if dis >= D:
        count+=1
print(count)

Submission status: Runtime Error

Solution code:
if 30<= x:
  print"Yes"
else:
  print"No"

Submission status: Runtime Error

Solution code:
X=input()
if (X>40||X<-40):
  return 0

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
x = int(input())
if x >= 30:
  print("YES")
 else:
  print("NO")

Submission status: Runtime Error

Solution code:
X=input()
if (X>40||X<-40):
  return 0
  if(X=>30):
    print(Yes)
  else:
    print(No)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math

n, d = map(int, input().split())
xy = [list(map(int, input().split())) for a in range(n)]
count = 0
for i in range(n):
    number = (xy[i][0]**2)+(xy[i][1]**2)
    result = math.sqrt(number)
    if result <= d:
        count += 1
    else:
        count += 0
print(count)

Submission status: Runtime Error

Solution code:
X = int()
 -40 <= X <= 40
def Air_Conditioner(X):
    if -40 <= X < 30:
        return "No"
    elif 30 <= X <= 40:
        return "Yes"

Air_Conditioner(X)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
input(X)
if (X>40||X<-40):
  return 0
  if(X=>30):
    print(Yes)
  else:
    print(No)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
N,D = map(int, input().split())
Count = 0
for i in range(N):
    x, y = map(int, input().split())
    total = x**2 + y**2
    kyori = math.sqrt(total)
    if kyori <= D:
        Count = Count + 1

print(Count)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
 
N,D= list(map(int,input().split()))
x = [0] * N
y = [0] * N
b=0
 
for i in range(N):
     x[i], y[i] = map(int, input().split())
     a=x[i]**2+y[i]**2
     if math.sqrt(a) <=D:
          b+=1
print(b)

Submission status: Runtime Error

Solution code:
n = int(input)

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
if n >= 30:
	print("YES)
else:
	print("NO)

Submission status: Runtime Error

Solution code:
n = int(input())
if n > 29:
  print("Yes")
  elif 0 < n <= 29:
    print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
x = input()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n, d = input().split()
n = int(n)
d = int(d)
xy = [map(int, input().split()) for _ in range(n)]
x, y = [list(i) for i in zip(*xy)]
c = 0

for i in range(n):
  if x[i]*x[i]+y[i]*y[i] <= d*d:
    c +=1

print(c)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
X = int(input())
if X >= 30:
  print("Yes")
  elif -40 <= X <= 29:
  print("No")
  else:
    pass

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

else:
    print("No")

Submission status: Runtime Error

Solution code:
x = input()

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

Submission status: Runtime Error

Solution code:
x = int(input(""))

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
x = input()

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

Submission status: Runtime Error

Solution code:

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

Submission status: Runtime Error

Solution code:
temp=int(input())
if temp>=30:
  print("YES")
 else:
  print("NO")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
temperature = int(input())

if 30 <= temperature:
    print('Yes')
els:
    print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
x = int(input("x"))

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
X = int(input())

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

Submission status: Runtime Error

Solution code:
import datetime
import string
import re
import math

input = Int(input())

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

return

Submission status: Runtime Error

Solution code:
X = input()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;

typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<db, db> pd;

typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<ll> vl;
typedef vector<db> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<pd> vpd;

typedef set<int> si;
typedef set<ll> sl;
typedef map<int, int> mii;

#define mp make_pair
#define sz(x) (int)x.size()
#define len(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
//#define pf push_front
//#define pb push_back
#define eb emplace_back
#define ep emplace
#define lb lower_bound
#define ub upper_bound

#define vfor(i, a, b) for (int i = (a); i < (b); ++i)
#define f0r(i, a) vfor(i,0,a)
#define rof(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define r0f(i, a) rof(i,0,a)
#define trav(a, x) for (auto& a: x)
#define ceildiv(num, mod) ((num)/(mod)+((num)%(mod)>0))
#define def(fname, rtype, args, ...) function<rtype args> fname = [__VA_ARGS__] args

#define boost() cin.tie(0),cin.sync_with_stdio(0)

template<class T>
void binstf(T &found, T a, T b, function<bool(T)> test, bool TF = true) {
    T i = a, j = b;
    bool da = test(a), db = test(b);
    if ((da != TF) or (db == TF)) {
        cerr << "---[BS: TF = " << TF << "]---" << endl;
        cerr << a << "->" << da << endl;
        cerr << b << "->" << db << endl;
    }
    while (j - i > 1) {
        T m = (i + j) / 2;
        if (test(m) == TF)
            i = m;
        else
            j = m;
    }
    found = i;
    if (not TF)
        found++;
}

#define binsft(a, b, c, d) binstf(a,b,c,d,false);

template<class T>
T dpow(T a, T power) {
    T result = 1;
    while (power) {
        if (power % 2)result *= a;
        power /= 2, a = a * a;
    }
    return result;
}

const ld PI = acos((ld) -1);
mt19937 rng((uint32_t) chrono::steady_clock::now().time_since_epoch().count());

template<class T>
bool ckmin(T &a, const T &b) {
    return b < a ? a = b, 1 : 0;
}

template<class T>
bool ckmax(T &a, const T &b) {
    return a < b ? a = b, 1 : 0;
}

template<class T>
bool reorder(T &a, T &b) {
    return (a > b) ? swap(a, b), 1 : 0;
}

// INPUT
template<class A>
void re(complex<A> &c);

template<class A, class B>
void re(pair<A, B> &p);

template<class A>
void re(vector<A> &v);

template<class A, size_t SZ>
void re(array<A, SZ> &a);

#define ore(type, x) type x;re(x);
#define ire(x) ore(int,x);
#define vire(x) ore(vi,x);
#define lre(x) ore(ll,x);

template<class T>
void re(T &x) { cin >> x; }

void re(db &d) {
    str t;
    re(t);
    d = stod(t);
}

void re(ld &d) {
    str t;
    re(t);
    d = stold(t);
}

template<class H, class... T>
void re(H &h, T &... t) {
    re(h);
    re(t...);
}

template<class A>
void re(complex<A> &c) {
    A a, b;
    re(a, b);
    c = {a, b};
}

template<class A, class B>
void re(pair<A, B> &p) { re(p.first, p.second); }

template<class A>
void re(vector<A> &x) { trav(a, x) re(a); }

template<class A, size_t SZ>
void re(array<A, SZ> &x) { trav(a, x) re(a); }

template<class T>
T gcd(T a, T b) {
    a = a < 0 ? -a : a;
    b = b < 0 ? -b : b;
    if (a * b == 0)
        return max(a, b);
    else return gcd(min(a, b), max(a, b) % min(a, b));
}


const int MODE107 = 1000000007;

template<class T>
T modop(T a, T mode = MODE107) {
    a = a % mode;
    if (a < 0)a += mode;
    return a;
}

template<class T>
T inv(T a, T mode = MODE107) {
    T coefa = 1, coefb = 0;
    T aa = a, bb = mode;
    while (aa != 1) {
        if (aa > bb)swap(coefa, coefb), swap(aa, bb);
        T cc = bb / aa;
        bb -= cc * aa, coefb -= cc * coefa;
        swap(coefa, coefb), swap(aa, bb);
    }
    return coefa;
}


const int uplrDX[] = {-1, 1, 0, 0};
const int uplrDY[] = {0, 0, -1, 1};

#define ts to_string

str ts(char c) { return str(1, c); }

str ts(bool b) { return b ? "true" : "false"; }

str ts(const char *s) { return (str) s; }

str ts(str s) { return s; }

template<class A>
str ts(complex<A> c) {
    stringstream ss;
    ss << c;
    return ss.str();
}

str ts(vector<bool> v) {
    str res = "{";
    f0r(i, sz(v)) res += char('0' + v[i]);
    res += "}";
    return res;
}

template<size_t SZ>
str ts(bitset<SZ> b) {
    str res = "";
    f0r(i, SZ) res += char('0' + b[i]);
    return res;
}

template<class A, class B>
str ts(pair<A, B> p);

template<class T>
str ts(T v) { // containers with begin(), end()
    bool fst = 1;
    str res = "{";
    for (const auto &x: v) {
        if (!fst) res += ", ";
        fst = 0;
        res += ts(x);
    }
    res += "}";
    return res;
}

template<class A, class B>
str ts(pair<A, B> p) {
    return "(" + ts(p.first) + ", " + ts(p.second) + ")";
}

// OUTPUT
template<class A>
void pr(A x) { cout << ts(x); }

template<class H, class... T>
void pr(const H &h, const T &... t) {
    pr(h);
    pr(t...);
}

void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T>
void ps(const H &h, const T &... t) {
    pr(h);
    if (sizeof...(t)) pr(" ");
    ps(t...);
}

// DEBUG
void DBG() { cerr << "]" << endl; }

template<class H, class... T>
void DBG(H h, T... t) {
    cerr << ts(h);
    if (sizeof...(t)) cerr << ", ";
    DBG(t...);
}

#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif


// REINITIALIZE ARRAYS BETWEEN TCs

/**
 * Description: Use in place of \texttt{complex<T>}.
 * Source: http://codeforces.com/blog/entry/22175, KACTL
 * Verification: various
 */

typedef int T;

int sgn(T a) { return (a > 0) - (a < 0); }

T sq(T a) { return a * a; }

//using namespace Point;

typedef unsigned long long ull;

class trie {
public:
    map<char, trie> l;

    void add(string t) {
        if (t.length() > 0) {
            l[t[0]].add(t.substr(1));
        }
    }

    bool contains(string t) {
        if (not l.count(t[0]))
            return false;
        return l[t[0]].contains(t.substr(1));
    }
};

template<class T>
class rq {
    /* range query
     */
    vector<vector<T>> content;
    function<T(T, T)> op;

public:
    rq(vector<T> &orig, function<T(T, T)> operation) {
        op = operation;
        int size = 1;
        content.emplace_back(orig);
        while (size < orig.size()) {
            size *= 2;
            content.emplace_back(0);
            auto &todo = content.back(), &from = content[content.size() - 2];
            f0r(i, sz(from) - size / 2) {
                todo.eb(op(from[i], from[i + size / 2]));//[i ~ i+s[ = [i, i+s/2[ + [i+s/2,i+s[
            }
        }
    }

    T query(int i, int j) {//[i,j[
        if (j <= i or j > content[0].size() or i < 0 or i >= content[0].size()) {
            cerr << "i=" << i << endl;
            cerr << "j=" << j << endl;
            throw "bad i j";
        }
        tie(i, j) = mp(min(i, j), max(i, j));
        int size = 1, pow = 0;
        while (size * 2 < j - i) {
            size *= 2, pow++;
        }
        assert(pow < content.size());
        auto &c = content[pow];
        assert(i < c.size() and i >= 0);
        assert(j - size < c.size() and j - size >= 0);
        T dbg = op(content[pow][i], content[pow][j - size]);
        return dbg;
    }
};

template<class T>
class maxflow {
public:
    typedef T unit;
    int src, drn;//source and drain node id
    vector<vi> adj, radj;
    map<pi, unit> lims;
    map<pi, unit> rlims;//will contain solution after solve()
    void genradj() {
        radj.resize(sz(adj));
        f0r(from, sz(adj)) {
            trav(to, adj[from]) {
                radj[to].emplace_back(from);
            }
        }
    }

    unit solve() {
        while (true) {
            map<int, pair<pi, unit>> backtrack;
            bool found = false;
            set<int> seen;//bfs from src
            queue<pair<int, unit>> todo;
            todo.emplace(src, -1);
            while (not todo.empty()) {
                int from = todo.front().first;
                unit bottleneck = todo.front().second;
                todo.pop();
                if (from == drn) {
                    found = true;
                    break;
                }
                trav(to, adj[from]) {
                    pi edge = mp(from, to);
                    unit bn = min(bottleneck, lims[edge]);
                    if (bn and not seen.count(to)) {
                        seen.emplace(to);
                        todo.emplace(to, bn);
                        backtrack[to] = mp(edge, bn);
                    }
                }

                trav(to, radj[from]) {
                    pi edge = mp(to, from);
                    unit bn = min(bottleneck, rlims[edge]);
                    if (bn and not seen.count(to)) {
                        seen.emplace(to);
                        todo.emplace(to, bn);
                        backtrack[to] = mp(edge, bn);
                    }
                }
            }
            if (not found)
                break;
            else {
                list<pi> edges;
                int to = drn;
                unit flow = backtrack[to].second;
                while (to != src) {
                    pi edge = backtrack[to].first;
                    int from = edge.first + edge.second - to;
                    edges.emplace_front(edge);
                    to = from;
                }
                int from = src;
                trav(e, edges) {
                    if (e.first == from)
                        rlims[e] += flow, lims[e] -= flow;
                    else
                        rlims[e] -= flow, lims[e] += flow;
                    from = e.first + e.second - from;
                }
            }
        }
        unit res = 0;
        trav(to, adj[src])res += rlims[mp(src, to)];
        return res;
    }

};

auto __tic__ = chrono::high_resolution_clock::now();

void tic() {
    __tic__ = chrono::high_resolution_clock::now();
}

void toc() {
    ps(chrono::duration_cast<chrono::microseconds>(chrono::high_resolution_clock::now() - __tic__).count(), "us");
    cout << endl;
}

void precalc() {
    //start here
}

void solve(int ti) {
    //start here
    int n;
    re(n)
    ps(n>=30?"Yes":"No");

}


int main() {

    precalc();
    bool online = true;
#ifdef OFFLINE
    online = false;
    if (online)
        boost();
    string testinputs[] = {
            R"(
10
-10 -1 2 2 5 -2 -3 -4 2 -6
-1 -1 2 2 -1 5 5 7 7 9




)",
//            R"(3 2
//1 1 0
//1 2
//1 3
//
//)",
    };//TODO
    trav(testinput, testinputs) {
        istringstream iss(testinput);
        cout << "---local mode---" << endl;
        cin.rdbuf(iss.rdbuf());
#endif
        // setIO("A");
        int T = 1;
        {
//            re(T);
        }
        vfor(i, 1, T + 1) {
//        cout << "Case #" << i << ": ";//Google Code jam
            solve(i);
        }

#ifdef OFFLINE
    }
#endif
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
temp = int(input())

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
X = int(input())

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include<algorithm>
#include<cmath>
#include<iostream>
#include<vector>
#include<string>
using namespace std;
typedef long long ll;

#define REP(i, n) for(ll i=0;i<ll(n); i++)

int main(){
    int x;
    cin >> x;
    if(x >= 30){
        cout << "Yes" << endl;
    }
    else{
        cout << "No" << endl;
    }
    return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include<iostream>
using namespace std;
int main(){
	int x;
	cin>>x;
	if(x>30)cout<<"Yes"<<endl;
	else cout<<"No"<<endl;
	return 0;
}

Submission status: Runtime Error

Solution code:
X = input()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
X = int(input())
return X>=30

Submission status: Runtime Error

Solution code:
n=int(input())

if n>=30:
	print("Yes)

else:
	print("No")

Submission status: Runtime Error

Solution code:
n = int(input())

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

Submission status: Runtime Error

Solution code:
x = int(input())

if　x>29:
  print("yes")
else:
  print("no")

Submission status: Runtime Error

Solution code:
import sys,math,collections
from collections import defaultdict

#from itertools import permutations,combinations
	
def file():
	sys.stdin = open('input.py', 'r')
	sys.stdout = open('output.py', 'w') 
def get_array():
	l=list(map(int, input().split()))
	return l
def get_2_ints():	
	a,b=map(int, input().split())
	return a,b
def get_3_ints():	
	a,b,c=map(int, input().split())
	return a,b,c	
def sod(n):
	n,c=str(n),0
	for i in n:	
		c+=int(i)
	return c	
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
def getFloor(A, x):

	(left, right) = (0, len(A) - 1)

	floor = -1
	while left <= right:
		mid = (left + right) // 2
		if A[mid] == x:
			return A[mid]
		elif x < A[mid]:
			right = mid - 1
		else:
			floor = A[mid]
			left = mid + 1
			
	return floor
def floorSqrt(x) : 
  
    # Base cases 
    if (x == 0 or x == 1) : 
        return x 
   
    # Do Binary Search for floor(sqrt(x)) 
    start = 1
    end = x    
    while (start <= end) : 
        mid = (start + end) // 2
          
        # If x is a perfect square 
        if (mid*mid == x) : 
            return mid 
              
        # Since we need floor, we update  
        # answer when mid*mid is smaller 
        # than x, and move closer to sqrt(x) 
        if (mid * mid < x) : 
            start = mid + 1
            ans = mid 
              
        else : 
              
            # If mid*mid is greater than x 
            end = mid-1
              
    return ans	
#file()
def main():
	for tt in range(int(input())):
		n=int(input())
		
		if(n>=30):
			print("yes")
		else:
			print("no")	



	

	
	

		











		
		

		























































				

			







            
			
































		








if __name__ == '__main__':
    main()

Submission status: Runtime Error

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