peterverebics/CodeNet_Python_118 huggingface dataset:
import math
x=int(input())
if 360%x==0:
  print(360//x)
else:
  k=0
  xt=x
  p=[0,1]
  for i in range(1,2000):
    xt+=x
    rad=xt/180*math.pi
    p[0]+=-math.sin(rad)
    p[1]+=-math.cos(rad)
    if math.isclose(p[0], 0, abs_tol=1e-10) and math.isclose(p[1], 0, abs_tol=1e-10):
      break
  if i==999:
    print(0)
  else:
    print(i)
def main():
    X=int(input())
    print(360//X)

if __name__=="__main__":
    main()
x=int(input())
if 1<=x<=179:
	if 360/x>int(360/x):
		print(int(360/x)+1)
	else:
		print(int(360/x))
import math
n=int(input())
step = 360//n
print(step)
x = int(input())
if x <= 90:
  print(int(360/x))
else:
  print(int(360/(180-x)))
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


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

    for i in range(1, 361):
        if ((180 - x) * i) % 360 == 0:
            return print(i)


if __name__ == '__main__':
    main()
import sys
import math
import numpy as np
import functools
import operator
import collections
import itertools

X=int(input())
ans=1
for i in range(1,100000):
    if X*i==360:
        print(ans)
        sys.exit()
    ans+=1
import math
x=int(input())
x=180-x

print(360//math.gcd(360,x))
import sys
import math
input = sys.stdin.readline

def inp():
    return(int(input()))

x = inp()
if x>180:
    print(360//(x-180))
else: print(360//x)
import math
x = int(input())
def lcm(x, y):
    return (x * y) // math.gcd(x, y)
if x == 1:
  print(360 / x)
elif x == 45:
  print(360 / x)
elif x == 90:
  print(360 / x)
else:
  z = lcm(x, 360)
  print(math.floor(z / x))
X = int(input())
K = int(360//X)
if 360%X==0:
  print(K)
else:
  print(K+1)
x = int(input())
x = 180 - x
y = 360
while y % x != 0:
  y += 360
print(y // x)
x = int(input())
n = 360
cnt = 0
if 360 % x == 0:
    print(360//x)
else:
    while n != 0:
        if n == 0:
            cnt += 1
            break
        elif n > 0:
            n -= x
            cnt += 1
        else:
            n += 180
print(cnt-1)
X = int(input())
K = 0
while ((X * K) % 360 != 0) and (K == 0):
  K += 1
print(K)
x = int(input())
if x > 0:
  print(360//x)
  exit()
else:
  print(-1)
import math
X = int(input())

if 360 % X == 0:
    ans = 360 // X
else:
    if 360 % (180 - X) == 0:
        ans = 360 // (180 - X)
    else:
        ans = (360 * X) // math.gcd(360, X)
print(ans)
X= int(input())

if 360 % X != 0:
  print(360)
else:
  print(int(360/X))
def gcd(a,b):
    a,b = max(a,b),min(a,b)
    while b:
        a,b =b,a%b
    return a

X=int(input())

if 360%X==0:
    print(360//X)
else:
    g =gcd(360,X)
    print(360*X//g)
a=int(input())
b=360/a
b2=str(b)
head, sep, tail = b2.partition('.')
if (tail[0]=='0') or (tail[0]==9):
    print(int(b))
else:
    print(int(head)+1)
# -*- coding: utf-8 -*-
 
## Library
 
import sys
from fractions import gcd
import math
from math import ceil,floor
import collections
from collections import Counter
import itertools

## input
 
# N=int(input())
# A,B,C,D=map(int, input().split())
# S = input()
# yoko = list(map(int, input().split()))
# tate = [int(input()) for _ in range(N)]
# N, M = map(int,input().split()) 
#    P = [list(map(int,input().split())) for i in range(M)]
 
X=int(input())

# X x ans = 360
# ans = 360/X

if 360%X == 0:
    print(360//X)
else:
    print(X*(180-X)//math.gcd(X,180-X))
X = int(input())
if 1 <= X <= 179:
    K = 360 // X
    K = int(K)
    print(K)
def times(X):
    x = int(X)
    1<= X <= 179
    K = 360/X
    return K
def times(X):
    x = int(X)
    1<= X <= 179
    K = 360/X
    print(int(K))
    return K
times(90)
times(1)
t=int(input())
if(360%t==0):
  print(360/t)
else:
  t=360/t
  s=360%t
  print(t*s)
#

import sys
input=sys.stdin.readline

def main():
    X=int(input())
    print(int(360//X))
    
    
    
if __name__=="__main__":
    main()
x = int(input())
import math
a = -(-360//x)
b = math.gcd(x,360)
print(a*(360//b))
a = int(input())
res = 0
while a:
    res += 360//a
    a = 360%a
print(res)
a=int(input())
for i in range(1,361):
  if a*i==360:
    print(str(int(i)))
    break
  else:
    for j in range(1,361):
     if a*i/j==360:
      print(str(int(j*i)+1))
      break
     else:
       pass
x=int(input())
i=1

while (x*i)%180!=0:
  i=i+1

print(i)
X = int(input()) 
if X <= 90:
  print(int(360/X))
else:
  print(int(720/X))
x = int(input())
if x < 90: print(360)
else: print(360//(180-x))
a = int(input())
b = 1
while b < 180:
    b += 1
    ans = b * a
    if ans == 360:
        print(b)
import math
import numpy as np
X = int(input())
a = float(0)
b = float(0)

for i in range(0,90): 
	Y = X * i
	a += np.sin(Y)
	b += np.cos(Y)
	if a == 0 and b == 0: 
		break
print(i)
X = int(input())
if 1 <= X <= 179:
    K = 360 / X
    if int(K) == K:
        K = int(K)
        print(K)
    else:
        K = int(int(K) + 1)
        print(K)
x = int(input())
print(360//x if 360%x == 0 else 360//x + 1)
x=int(input())
if 1<=x<=179:
	if 360/x>int(360/x):
		print(int(360/x)+1)
	else:
		int(360/x)
x = int(input())
for i in range(1000):
    if x * (i+1) == 360:
        print(i+1)
        exit()
x = int(input())
import math

steps = 1
X = x

a,b = math.sin((22*x)/(7*180)),math.cos((22*x)/(7*180))
while True:
    # print(x,a,b)
    x = (x+X)
    r = (22*x)/(7*180)
    a = a + math.sin(r)
    b = b + math.cos(r)
    steps+=1
    if a<10**-12 and b<10**-12:
        break
    
    
print(steps+1)
x=int(input())
a=360/(180-x)
if(int(a)==a):
  print(a)
else:
  a=360/x
  print(int(a))
n=int(input())
for i in range(1,360+1):
  if n*i%360==0:
    print(i)
x = int(input())
if x <= 90:
  print(int(360/x)) if 360%x == 0 else print(int(360/x)+1)
else:
  print(int(360/(180-x))) if 360%(180-x) == 0 else print(int(360/(180-x))+1)
theta= int(input())
if 360%(180-theta)==0:
    print(360//(180-theta))
elif 360%theta==0:
    print(360//theta)
else:
    print(360)
a = int(input())
b = 0
for i in range(1,361):
    i += 1
    ans = i * a
    if ans == 360:
        print(int(i))
from sys import stdin


def main():
    input = lambda: stdin.readline()[:-1]
    X = int(input())

    n, s = 3, 180
    while 1:
        d = s // n
        if d == X or d == 180 - X:
            break
        else:
            n += 1
            s += 180
    print(n)


main()
from math import gcd
x=int(input())
g=gcd(360,x)
print(360/g)
x = int(input())

for n in range(1, 10000):
    k, y = divmod(360*n, (180-x))
    if y == 0:
        print(k)
        break
def times(X):
    if X == int(X):
        if 1<= X <= 179:
            K = 360/X
            if int(K) < K :
                K = int(int(K) - 1)
                print(K)
            else:
                K = int(K)
                print(K)
k = int(input())

num = int(360 / k)

print(num)
a=int(input())
for i in range(1,361):
  if a*i==360:
    print(str(int(i)))
    break
  else:
    for j in range(1,361):
     if a*i/j==360:
      print(i)
      break
     else:
       pass
import math
x=int(input())
print((x*360)//math.gcd(x,360))
import math

X = int(input())

ans = 360/X
print(math.ceil(ans))
x =int(input())
if 360%x ==0:
    print(360//x)
else:
    print(360)
x=int(input())
x=min(x,180-x)
X=x
k=1
while X%360!=0:
    k+=1
    X+=x
print(k)
import math

angle = int(input())
c = 1
x = 0
y = 1

while [round(x),round(y)] != [0,0]:
  angle_u= 180-angle*c
  y -= math.cos(math.radians(angle_u))
  x -= math.sin(math.radians(angle_u))
  c += 1
else:
  print(c)
# -*- coding: utf-8 -*-
 
## Library
 
import sys
from fractions import gcd
import math
from math import ceil,floor
import collections
from collections import Counter
import itertools

## input
 
# N=int(input())
# A,B,C,D=map(int, input().split())
# S = input()
# yoko = list(map(int, input().split()))
# tate = [int(input()) for _ in range(N)]
# N, M = map(int,input().split()) 
#    P = [list(map(int,input().split())) for i in range(M)]
 
X=int(input())

# X x ans = 360
# ans = 360/X

if 360%X == 0:
    print(360//X)
else:
    print(360)
# -*- coding: utf-8 -*-
 
## Library
 
import sys
from fractions import gcd
import math
from math import ceil,floor
import collections
from collections import Counter
import itertools

## input
 
# N=int(input())
# A,B,C,D=map(int, input().split())
# S = input()
# yoko = list(map(int, input().split()))
# tate = [int(input()) for _ in range(N)]
# N, M = map(int,input().split()) 
#    P = [list(map(int,input().split())) for i in range(M)]
 
X=int(input())

# X x ans = 360
# ans = 360/X

if 360%X == 0:
    print(360//X)
else:
    print(math.gcd(180-X,360))
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7

X = i()
print(math.ceil(360/X))
from math import gcd
N = int(input())
print(N // gcd(360, N))
n1=input()
n=int(n1)
a=360/n
print(round(a))




#if __name__ == '__main__':
import sys
input = sys.stdin.readline

def inp():
    return(int(input()))

x = inp()
print(360/x)
# -*- coding: utf-8 -*-
 
## Library
 
import sys
from fractions import gcd
import math
from math import ceil,floor
import collections
from collections import Counter
import itertools

## input
 
# N=int(input())
# A,B,C,D=map(int, input().split())
# S = input()
# yoko = list(map(int, input().split()))
# tate = [int(input()) for _ in range(N)]
# N, M = map(int,input().split()) 
#    P = [list(map(int,input().split())) for i in range(M)]
 
X=int(input())

# X x ans = 360
# ans = 360/X

if 360%X == 0:
    print(360//X)
else:
    print(X*360//math.gcd(X,360))
import math
X=int(input())
if 360 % X == 0:
    print(360//X)
else:
    print(math.ceil(360/X))
def solve(x):
    k = 0
    while k*x % 360 != 0:
        k += 1
    return k
    
x = int(input())
print(solve(x))
import math
X = float(input())
print(math.ceil(360 / X))
x = int(input())
if 360%x==0:
    print(int(360/x))
else:
    print(int(360/x)+1)
import math
X=int(input())
print(360//X if 360%X==0 else X*360//math.gcd(X,360))
x = int(input())
if 360 % x == 0:
  print(360//x)
elif 360 % (180 - x) == 0:
  print(360//(180-x))
else:
  print(360)
import sys

X = int(input())

if 360 % X == 0:
    print(360 // X)
else:
    print(360)
# coding: utf-8
import math
import numpy as np
#N = int(input())
#A = list(map(int,input().split()))
x = int(input())
#x, y = map(int,input().split())
print(360//x)
X=int(input())
for i in range (180):
    if X*i%360==0:
        print(i)
import math 
X = int(input())
lcm = 360 * X // math.gcd(360, X)
print(lcm)
K = lcm // X
print(K)
x = int(input())
ans = 0
a = 360
while True:
    if a%x==0:
        ans+=a//x
        break
    else:
        rem = a%x
        ans+=a//x
        a-=rem
print(ans)
import math
X = int(input())
if 360%X==0:
  print(360//X)
else:
  remainder = 360%X
  p = int(math.gcd(remainder,X))
  q = int((remainder*X)//p)
  count = int(360//X)
  i = 0
  r = remainder
  while i<q:
    count+=(((360+r)-7)//7)
    r = (r+remainder)%remainder
    i+=remainder
  print(count+(q//3))
X = int(input()) 
q1 = 360//X

if X == 60:
  print(3)
elif X == 120:
  print(6)
else:
  print(q1)
#  =========     /\       /|    |====/|
#      |        /  \       |    |   / |
#      |       /____\      |    |  /  |
#      |      /      \     |    | /   |
#  ========= /        \  =====  |/====|  
#  code

def main():
    x = int(input())
    ans = 360 // x
    print(ans)
    return

if __name__ == "__main__":
    main()
X=int(input())
if 360 % X == 0:
    print(360//X)
else:
    print(360*X)
X = int(input())

K = 1
dire = X
while True:
  if (dire % 180) == 0:
    break
  K+=1
  dire+=X

  
print(K)
def main():
    X = int(input())
    print(360//X)
main()
def solution(n):
  if n == 0 :
    return -1 
  val = 360 / n 
  return val
n =int(input())
print(solution(n))
x = int(input())
import math
a = -(-360//x)
b = math.gcd(360%x,360)
print(a*(360//b))
import math

x = int(input())
K = 360 / x
print(math.floor(K))
X = int(input())
if 360%X == 0:
    print(360//X)
else:
    print(360)
X = int(input())
if 360 % X == 0:
  print(360//X)
else:
  print(360)
#import math
#=input()
x=int(input())
#=map(int,input().split())
#=list(map(int,input().split()))
#=[list(map(int,input().split())) for _ in range()]

print(360//x)
#!/usr/bin/env python3
# atcoder 
# Türkler var mı?
# Herkese memnün oldum
import sys

iimr = lambda: map(int, sys.stdin.readline().rstrip().split())
sys.setrecursionlimit(10 ** 8)


def 関数(x):
    k = 360 // x
    return k

def çözmek():
    X = int(input())
    res = []
    res.append(関数(X))
    print(*res, sep="\n")

if __name__ == "__main__":
    çözmek()
import math

x = int(input())

if 360 % x == 0:
    m = math.ceil(360 / x)
    print(m)
else:
    print(0)
x = int(input())
t = 0
while True:
    if 360 % x == 0:
        res = int(360 / x)
        t += res
        break
    else:
        for i in range(2, 360):
            if i * x > 360:
                x = i * x - 360
                t += i
                break
print(t)
X = int(input())
rad = 90
cnt = 0

while True:
    cnt += 1
    if rad==360:
        break
    else:
        rad += X
        rad = rad if rad < 360 else 360

print(cnt)
k = int(input())
d, r = divmod(360, k)
while r:
  x, y = divmod(360, r)
  r = y
  d += x
print(d)
X = int(input())

if 360 % X:
  print(360 * X)
else:
  print(360 // X)
#!/usr/bin/env python3
# atcoder 
# Türkler var mı?
# Herkese memnün oldum
import sys

iimr = lambda: map(int, sys.stdin.readline().rstrip().split())
sys.setrecursionlimit(10 ** 8)


def 関数(x):
     
    k = 360 // x
    if (360 % x) != 0:
        k += 1
    return k

def teste():
    for i in range(1, 180):
        print(i,": ",  360 // float(i))

def çözmek():
    X = int(input())
    res = []
    res.append(関数(X))
    print(*res, sep="\n")

if __name__ == "__main__":
    çözmek()
y=x=int(input())
while y%360:y+=x
print(y/x)
X = int(input()) 
q1 = 360/X

if X == 60:
  print(3)
elif X == 120:
  print(6)
else:
  print(int(q1))
def times(x):
    x = int(x)
    if 1<= x <= 179:
        k = 360 / x
        print(k)
s=times(1)
x = int(input())
t = 0
while True:
    if 360 % x == 0:
        res = int(360 / x)
        t += res
        break
    else:
        for i in range(2, 361):
            if i * x > 360:
                x = i * x - 360
                t += i
                break
print(t)
from sys import stdin


def main():
    input = lambda: stdin.readline()[:-1]
    X = int(input())

    for n in range(3, 361):
        s = 180 * (n - 2)
        d, m = divmod(s, n)
        d = min(d, 180 - d)
        if d == X:
            print(n)
            break


main()
import sys
x = int(input())
y = 0
m = 0
if 360 % x == 0:
    m = int(360 / x)
else:
    for i in range(1, x + 1):
        y = x * i
        if y > 360:
            if y % 360 == 0:
                m = i
                break
                
print(m)
x = int(input())
y = 360 / x

if int(y) == y:
  print(int(y))
else:
  print(int(y+1))
X = int(input())
W = 360 + (X - 1)
print(W // X)
import sys
import math
def input(): return sys.stdin.readline().rstrip()
def main():
    x = math.radians(int(input()))
    cur_x, cur_y = 0, 1
    cur_dig = math.pi/2
    ans = 1
    while cur_x**2+cur_y**2>0.001:
        cur_dig += x 
        cur_x += math.cos(cur_dig)
        cur_y += math.sin(cur_dig) 
        ans += 1
    print(ans)

if __name__=='__main__':
    main()
x = int(input())
import math
ans = math.ceil(2*(180/x))
print(ans)
x=int(input())
a=360
for i in range(360):
  if a>x and a%x!=0:
    a=a%x
  elif a>x:
    break
  elif x%a!=0:
    x=x%a
  else:
    break
if x>=a:
  print(360/a)
else:
  print(360/x)
x=int(input())
if 360%x==0:print(360//x)
else:
    x=180-x
    print(360//x)
# -*- coding: utf-8 -*-


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

    print(math.ceil(360 / X))


if __name__ == '__main__':
    main()
from math import sin,cos,radians,pi
def main():
    n = int(input())
    n = radians(n)
    x,y = 0,0
    theta = radians(90)
    ans = 1
    while 1:
        # 1すすむ
        x += cos(theta)
        y += sin(theta)
        # n度回転
        theta -= n
        if theta<0: theta += radians(360)
        # 判定
        ans += 1
        if (int(x),int(y))==(0,0):
            print(ans)
            return

main()
# coding: utf-8
import math
import numpy as np
#N = int(input())
#A = list(map(int,input().split()))
x = int(input())
#x, y = map(int,input().split())
print(math.ceil(360/x))
import math
x=int(input())
x=180-x


print(360//math.gcd(360,x))
X = int(input())

if 360 % X == 0:
    print(360 // X)
    exit()
else:
    mod = 0
    cnt = 0
    while (360 + mod) % X != 0:
        cnt += (360 + mod) // X
        mod = (306 + mod) % X
    cnt += (360 + mod) // X

print(cnt)
import math

x = int(input())
a = math.gcd(360,x)
b = int(x/a)
c= int(360/a)
d = c*b
print(d)
x = int(input())
if 360%x == 0:
    print(360//x)
else:
    print(360)
n = int(input())

if 360 % n == 0:
    print(360 // n)
else:
    print(180 // n)
x = int(input())
import math
a = -(-360//x)
b = math.gcd(x,360)
b = 360 % x
if b == 0:
    print(a)
else:
    print(a*(360//b))
import math
X = int(input())
g = math.gcd(360, X)
print(g // X)
x = int(input())
while True:
    if 360 % x == 0:
        res = int(360 / x)
        break
    else:
        for i in range(2, 360):
            if i * x > 360:
                x = i * x - 360
                break
print(res)
a = int(input())
b = 0
while b <= 360:
    b += 1
    ans = b * a
    if ans == 360:
        print(b)
X = int(input())

r = X
ans = 0
while True:
  r += X
  r %= 360
  ans += 1
  if r == 0:
    break
print(ans)
X = int(input())
if 1 <= X <= 179:
    K = 360 / X
    if int(K) < K:
        K = int(int(K) - 1)
        print(K)
    else:
        K = int(K)
        print(K)
# import matplotlib.pyplot as plt
import math

def lcm(x, y):
   if x > y:
       z = x
   else:
       z = y

   while(True):
       if((z % x == 0) and (z % y == 0)):
           lcm = z
           break
       z += 1

   return lcm

def squaredDistance(a, b):
  return (a[0] - b[0]) ** 2 + (a[1] - b[1]) ** 2

X = int(input())
print(lcm(X, 360) / X)
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))

x = ii()
print(360//x)
import math
 
x = float(input())
if  360%x == 0:
	k = math.floor(360/x)
	print(k)
else:
	k = math.floor((360*x)/x)
	print(360)
x, y  = list(map(int, input().split()))


if (2 * x <= y <= 4 * x) and y % 2 == 0:
	print("Yes")
else:
	print("No")
from collections import defaultdict
it = lambda: list(map(int, input().strip().split()))
INF = float('inf')

def solve():
    X, Y = it()
    if Y % 2:
        return False
    return 4 * X >= Y >= 2 * X

if __name__ == '__main__':
    if not solve():
        print('No')
    else:
        print('Yes')
N, M = map(int,input().split())

kameasi = 4 * N

if M == kameasi:
  print('Yes')
  exit()

for i in range(1,N+1):
    # 足の数
    f = kameasi - 2*i 
    if f == M:
        print('Yes')
        break
else:
    print('No')
x,y = map(int , input().split())

t = 2
k = 4

flg = "No"
for i in range(x+1):
    if t*i + k*(x-i) == y:
        flg = "Yes"

print(flg)
# B

X,Y=map(int,input().split())
if Y<2*X or 4*X<Y:
    print("No")
else:
    if (Y-2*X)%2!=0 or (4*X-Y)%2!=0:
            print("No")
    else:
        print("Yes")
x, y = map(int, input().split())

flag = False
for i in range(x+1):
  v = i
  t = x - i
  f = 2 * v + 4 * t
  if f == y:
    flag = True

if flag:
  print("Yes")
else:
  print("No")
X, Y = map(int, input().split())

if (Y - 2*X) % 2 == 0 and X- (Y-2*X)/2 >= 0 and Y - 2*X >= 0:
    print("Yes")
else:
    print("No")
x,y = map(int, input().split())
flag = 0
for i in range(x+1):
  if (2 * i + 4 * (x - i)) == y:
    print("Yes")
    flag = 1

if flag == 0:
  print("No")
x, y = map(int, input().split())

for i in range(0, x+1):
    if i * 2 + (x - i) * 4 == y:
        print('Yes')
        exit()

print('No')
x, y = map(int, input().split())
judge='No'

for i in range(x+1):
  if(x==1 and (y==4 or y==2)):
    judge='Yes'
  if(y%4==0 and y/4==x):
    judge='Yes'
  if(y%2==0 and y/2==x):
    judge='Yes'
  for j in range(x+1-i):
    if((i*2+j*4)==y and i+j==x):
      judge='Yes'
    if((i*4+j*2)==y and i+j==x):
      judge='Yes'
      
if(y%2==1):
  judge='No'

print(judge)
X,Y = map(int,input().split())
if Y - 2 * X >= 0 and 2 * X - Y / 2 >= 0 and (Y - 2 * X) % 2 == 0:
    print('Yes')
else:
    print('No')
N, M = map(int,input().split())
for i in range(0, N+1):
    f = 2 * i + 4 * (N - i)
    if f == M:
        print("Yes")
        break
else:
    print('No')
line = list(map(int, input().split()))
if line[1] % 2 != 0:
    print("No")
elif line[0] * 4 >= line[1] and line[0] * 2 <= line[1]:
    print("Yes")
else:
    print("No")
x, y  = map(int, input().split())
if(y & 1):
  print("No")
elif(y < (x<<1) or y > (x<<2)):
  print("No")
else:
  print("Yes")
X, Y= map(int, input().split())

ans = 'No'
for a in range(X + 1):
    b = X - a
    if 2 * a + 4 * b == Y:
        ans = 'Yes'
print(ans)
x = list(map(int, input().split()))

if x[1]%2 == 1:
    print('No')
elif x[0]*2 <= x[1] <= x[0]*4:
    print('Yes')
else:
    print('No')
x,y=map(int,input().split())
s=y-2*x
t=4*x-y
if (s>0 and t>=0 or s>=0 and t>0) and s%2==0 and t%2==0:
  print('Yes')
else:
  print('No')
import sys

sys.setrecursionlimit(10 ** 8)

input = sys.stdin.readline


def main():
    X, Y = [int(x) for x in input().split()]

    for i in range(101):
        for j in range(101):
            if i + j == X and (i * 2 + j * 4 == Y or i * 4 + j * 2 == Y):
                print("Yes")
                return

    print("No")


if __name__ == '__main__':
    main()
def main():
    X, Y = map(int, input().split())
    flag = False
    for i in range(0, X+1):
        for j in range(0, X+1):
            if i + j == X and i*2 + j*4 == Y:
                flag = True
    
    if flag:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()
x, y = map(int, input().split())
count = 0

for num in range(x + 1):
   if  num * 4 + (x - num) * 2 == y:
       count += 1

print("Yes" if count > 0 else "No")
# -*- coding: utf-8 -*-
# 整数の入力
num, x = map(int, input().split())
# loop
flag = 0
for i in range(num + 1):
  if((2*i + 4*(num - i)) == x): flag += 1
print("No") if flag == 0 else print("Yes")
x,y = map(int,input().split())
#if (2*x)<y:
z=y-(2*x) #12本足りない z=12
a=z/2 #a=6 亀に変身する鶴の数

if a<=x and a>=0 and z%2==0:
    print('Yes')
else:
    print('No')
X, Y = map(int, input().split())
fin = ""
if (X * 4 < Y or X * 2 > Y or Y % 2 != 0):
	fin += "No"
else:
	fin += "Yes"
print(fin)
X,Y=map(int,input().split())
A=4*X-Y
B=(-2)*X+Y
if A%2==0 and B%2==0 and A>=0 and B>=0:
	print("Yes")
else:
	print("No")
x, y = map(int,input().split())

# 鶴をp羽とする

p = 0

for p in range(x+1):
  if 2*p + 4*(x-p) - y == 0:
    p=x+5
    break
  else:
    x=x


if p==x+5:
  print("Yes")
else:
  print("No")
x,y = map(int,input().split())
if y%2==0 and x*2<=y<=x*4:
    print("Yes")
else:
    print("No")
x, y = map(int,input().split())
f = False
for i in range(x+1):
    if 2*i + 4*(x-i) == y:
        f = True
        break
if f:
    print('Yes')
else:
    print('No')
import sys

X,Y=(int(x) for x in input().split())
#print(X,Y)
if Y%2==1:
  print('No')
  sys.exit()
if Y<2*X:
  print('No')
  sys.exit()
  

check=int((Y-2*X)/2)
#print(check)
if check<=X:
  print('Yes')
else:
  print('No')
X,Y= map(int,input().split())
b=(Y-2*X)%2
a=(4*X-Y)%2
B=(Y-2*X)/2
A=(4*X-Y)/2
if (b==0 and a==0 and A>=0 and B>=0):
    print('Yes')
else:
    print('No')
# coding: utf-8
n,m = map(int, input().split())

if n*4>=m and n*2<=m and (n*4-m)%2==0:
    print("Yes")
else:
    print("No")
import sys
X, Y = map(int, input().split())

for i in range(X+1):
    if Y == i*2 + (X-i)*4:
        print('Yes')
        sys.exit()
print('No')
x,y=map(int,input().split())
if y%2==0 and y<=4*x and y>=2*x:
    print('Yes')
else:
    print('No')
number = input().split(" ")
X = int(number[0])
Y = int(number[1])

if Y % 2 == 1:
    print("No")
else:
    if X * 4 >= Y:
        if X * 2 <= Y:
            print("Yes")
        else:
            print("No")
    else:
        print("No")