-----Input-----

The input consists of a single string of uppercase letters A-Z. The length of the string is between 1 and 10 characters, inclusive.


-----Output-----

Output "YES" or "NO".


-----Examples-----
Input
NEAT

Output
YES

Input
WORD

Output
NO

Input
CODER

Output
NO

Input
APRILFOOL

Output
NO

Input
AI

Output
YES

Input
JUROR

Output
YES

Input
YES

Output
NO

Difficulty: MEDIUM

Solutions:
curved = 'QRUOPJGDSCB'
s = input()
ctr = 0
for i in s:
	if i in curved:
		ctr += 1
if ctr == 0 or ctr == len(s):
	print('YES')
else:
	print('NO')


a = input()
print(('NO', 'YES')[sum((x in 'AEFHIKLMNTVWXYZ' for x in a)) in (0, len(a))])


straight = ['A', 'E', 'F', 'H', 'I', 'K', 'L', 'M', 'N', 'T', 'V', 'X', 'W', 'Y', 'Z']
s = list(input())
s = set(map(lambda x: x in straight, s))
print('YES' if len(s) == 1 else 'NO')


z = 'QWERTYUIOPASDFGHJKLZXCVBNM'
t = '01101101001001010111101011'
s = input()
cur = '-'
for i in s:
	for j in range(26):
		if z[j] == i:
			if cur == '-':
				cur = t[j]
			elif t[j] != cur:
				print('NO')
				exit(0)
print('YES')


ll = ['A', 'E', 'F', 'H', 'I', 'K', 'L', 'M', 'N', 'T', 'V', 'W', 'X', 'Y', 'Z']
s = input()
f1 = 0
f2 = 0
for i in range(len(s)):
	f1 = 0
	for j in range(15):
		if s[i] == ll[j]:
			f1 = 1
			if not i:
				f2 = 1
			elif not f2:
				print('NO')
				exit()
	if not f1:
		if not i:
			f2 = 0
		elif f2:
			print('NO')
			exit()
print('YES')


l = ['A', 'E', 'F', 'H', 'I', 'K', 'L', 'M', 'N', 'T', 'V', 'W', 'X', 'Y', 'Z']
s = input()
a = 0
for i in s:
	if i in l:
		a += 1
if a == len(s) or a == 0:
	print('YES')
else:
	print('NO')


s = input()
a = {'A', 'E', 'F', 'H', 'I', 'K', 'L', 'M', 'N', 'T', 'V', 'W', 'X', 'Y', 'Z'}
b = {'B', 'C', 'D', 'G', 'J', 'O', 'P', 'Q', 'R', 'S', 'U'}
print('YES' if all((c in a for c in s)) or all((c in b for c in s)) else 'NO')


n = input()
s = 'AEFHIKLMNTVWXYZ'
t = 'BCDGJOPQRSU'
f1 = 0
f2 = 0
for i in s:
	if i in n:
		f1 = 1
for i in t:
	if i in n:
		f2 = 1
if f1 + f2 == 1:
	print('YES')
else:
	print('NO')


import time
import os, sys
from io import BytesIO, IOBase
from types import GeneratorType
from bisect import bisect_left, bisect_right
from collections import defaultdict as dd, deque as dq, Counter as dc
import math, string, heapq as h
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		import os
		self.os = os
		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 = self.os.read(self._fd, max(self.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 = self.os.read(self._fd, max(self.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:
			self.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')

def getInt():
	return int(input())

def getStrs():
	return input().split()

def getInts():
	return list(map(int, input().split()))

def getStr():
	return input()

def listStr():
	return list(input())

def getMat(n):
	return [getInts() for _ in range(n)]

def getBin():
	return list(map(int, list(input())))

def isInt(s):
	return '0' <= s[0] <= '9'

def ceil_(a, b):
	return a // b + (a % b > 0)
MOD = 10 ** 9 + 7
neat = set('AEFHIKLMNTVWXYZ')
other = set('BCDGJOPQRSU')

def solve():
	assert len(neat) + len(other) == 26
	S = getStr()
	(x, y) = (0, 0)
	for letter in S:
		if letter in neat:
			x += 1
		else:
			y += 1
	return 'YES' if min(x, y) == 0 else 'NO'
print(solve())


(n, cnt) = (input(), 0)
for i in n:
	if i in set('AEFHIKLMNTVWXYZ'):
		cnt += 1
print('YES' if cnt == 0 or cnt == len(n) else 'NO')


t1 = ['A', 'E', 'F', 'H', 'I', 'K', 'L', 'M', 'N', 'T', 'V', 'W', 'X', 'Y', 'Z']
flag1 = False
flag2 = False
arr = list(input())
for i in arr:
	if i in t1:
		flag1 = True
	else:
		flag2 = True
if flag2 and flag1:
	print('NO')
else:
	print('YES')


s = input()
T = 'AEFHIKLMNTVWXYZ'
ok1 = 1
ok2 = 1
for i in s:
	if i not in T:
		ok1 = 0
	else:
		ok2 = 0
print(['NO', 'YES'][ok1 or ok2])


s = list(input())
L = ['A', 'E', 'F', 'H', 'I', 'K', 'L', 'M', 'N', 'T', 'V', 'W', 'X', 'Y', 'Z']
C = ['B', 'C', 'D', 'G', 'J', 'O', 'P', 'Q', 'R', 'S', 'U']
total = 0
for i in s:
	if i in L:
		total += 1
	if i in C:
		total += 2
if total == len(s) or total == len(s) * 2:
	print('YES')
else:
	print('NO')


lin = set(list('AEFHIKLMNTVWXYZ'))
cur = set(list('BCDGJOPQRSU'))
s = set(list(input()))
if lin | s == lin or cur | s == cur:
	print('YES')
else:
	print('NO')


NEAT = 'AEFHIKLMNTVWXYZ'
a = input()
print('YES' if all((x in NEAT for x in a)) or all((x not in NEAT for x in a)) else 'NO')


a = 'AEFHIKLMNTVWXYZ'
b = 'BCDGJOPQRSU'
s = input()
ina = True
inb = True
for x in s:
	if x not in a:
		ina = False
	if x not in b:
		inb = False
if ina or inb:
	print('YES')
else:
	print('NO')


list = 'AEFHIKLMNTVWXYZ'
word = input()
(x, y) = (0, 0)
for w in word:
	if w in list:
		x += 1
	else:
		y += 1
if x == 0 or y == 0:
	print('YES')
else:
	print('NO')


a = input()
b = len(a)
c = []
for i in range(b):
	c.append(a[i])
d = 0
dict1 = dict(W=1, E=1, T=1, Y=1, I=1, A=1, F=1, H=1, K=1, L=1, Z=1, X=1, V=1, N=1, M=1, Q=0, R=0, U=0, O=0, P=0, S=0, D=0, G=0, J=0, C=0, B=0)
for i in range(b):
	d += dict1.get(c[i])
if d == 0 or d == b:
	print('YES')
else:
	print('NO')


clean = 'AEFHIKLMNTVWXYZ'
string = input()
sum_ = 0
for i in string:
	if i in clean:
		sum_ += 1
if sum_ == len(string) or sum_ == 0:
	print('YES')
else:
	print('NO')


def main():
	a = set('AEFHIKLMNTVWXYZ')
	b = set('BCDGJOPQRSU')
	w = list(input())
	in_a = False
	in_b = False
	for l in w:
		in_a = in_a or l in a
		in_b = in_b or l in b
	if in_a and in_b:
		print('NO')
	else:
		print('YES')
main()


word = input()
count = len([letter for letter in word if letter in 'AEFHIKLMNTVWXYZ'])
print('YES') if count == 0 or count == len(word) else print('NO')


straights = ['A', 'E', 'F', 'H', 'I', 'K', 'L', 'M', 'N', 'T', 'V', 'W', 'X', 'Y', 'Z']
circs = ['B', 'C', 'D', 'G', 'J', 'O', 'P', 'Q', 'R', 'S', 'U']

def isAcuurate(n):
	k = n[0] in straights
	for el in n:
		if k and el in circs:
			return 'NO'
		elif not k and el in straights:
			return 'NO'
	return 'YES'
n = str(input())
print(isAcuurate(n))


x = []
mylist = list(input())
for i in mylist:
	if i in 'BCDGJOPQRSU':
		x.append(True)
	else:
		x.append(False)
if all((x[0] == elem for elem in x)):
	print('YES')
else:
	print('NO')


lin = set(list('WETYIAFHKLZXVNM'))
s = input()
print('YES' if len(set(list(s)).intersection(lin)) in [len(set(list(s))), 0] else 'NO')


p = 'AEFHIKLMNTVWXYZ'
q = 'BCDGJOPQRSU'
word = input()
(x, y) = (0, 0)
for w in word:
	if w in p:
		x += 1
	else:
		y += 1
if x == 0 or y == 0:
	print('YES')
else:
	print('NO')


zw = [True, False, False, False, True, True, False, True, True, False, True, True, True, True, False, False, False, False, False, True, False, True, True, True, True, True]
h = True
s = input()
b = zw[ord(s[0]) - 65]
for i in s:
	if b != zw[ord(i) - 65]:
		h = False
		break
if h:
	print('YES')
else:
	print('NO')


neats = 'AEFHIKLMNTVWXYZ'
s = input()
(un, n) = (0, 0)
for c in s:
	if c not in neats:
		un += 1
	else:
		n += 1
print('YES' if un == 0 or n == 0 else 'NO')


s = str(input())
straight = ['A', 'E', 'F', 'H', 'I', 'K', 'L', 'M', 'N', 'T', 'V', 'W', 'X', 'Y', 'Z']
bendy = [i for i in 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' if i not in straight]
ans = 0
for i in s:
	if i in straight:
		ans += 1
if ans % len(s) == 0:
	print('YES')
else:
	print('NO')


def f(s):
	ok = set('AEFHIKLMNTVWXYZ')
	cnt = 0
	for i in s:
		if i in ok:
			cnt += 1
	return cnt == 0 or cnt == len(s)
print('YES' if f(input()) else 'NO')