n=eval(input())

m=eval(input())

alphabet={'a':1,'b':2,'c':3,'d':4,'e':5,'f':6,'g':7,'h':8,'i':9,'j':10,'k':11,'l':12,'m':13,'n':14,'o':15,'p':16,'q':17,'r':18,'s':19,'t':20,'u':21,'v':22,'w':23,'x':24,'y':25,'z':26}

a=[]

for i in range(len(n)):

  a.append(alphabet[n[i]])

a.sort()

b=[]

for i in range(len(m)):

  b.append(alphabet[m[i]])

b.sort(reverse=True)



for i in range(min(len(n),len(m))):

  if a[i]<b[i]:

    print('Yes')

    exit()

if len(n)<len(m):

  for i in range(len(n)):

    if a[i]>b[i]:

      print('No')

      exit()

  print('Yes')

  exit()

print('No')
n=sorted(eval(input()))

m=sorted(eval(input()),reverse=True)

if n<m:

  print('Yes')

else:

  print('No')
n = eval(input())
m = eval(input())
alphabet = {
    "a": 1,
    "b": 2,
    "c": 3,
    "d": 4,
    "e": 5,
    "f": 6,
    "g": 7,
    "h": 8,
    "i": 9,
    "j": 10,
    "k": 11,
    "l": 12,
    "m": 13,
    "n": 14,
    "o": 15,
    "p": 16,
    "q": 17,
    "r": 18,
    "s": 19,
    "t": 20,
    "u": 21,
    "v": 22,
    "w": 23,
    "x": 24,
    "y": 25,
    "z": 26,
}
a = []
for i in range(len(n)):
    a.append(alphabet[n[i]])
a.sort()
b = []
for i in range(len(m)):
    b.append(alphabet[m[i]])
b.sort(reverse=True)
for i in range(min(len(n), len(m))):
    if a[i] < b[i]:
        print("Yes")
        exit()
if len(n) < len(m):
    for i in range(len(n)):
        if a[i] > b[i]:
            print("No")
            exit()
    print("Yes")
    exit()
print("No")

n = sorted(eval(input()))
m = sorted(eval(input()), reverse=True)
if n < m:
    print("Yes")
else:
    print("No")

-n = eval(input()) -m = eval(input()) -alphabet = { -    "a": 1, -    "b": 2, -    "c": 3, -    "d": 4, -    "e": 5, -    "f": 6, -    "g": 7, -    "h": 8, -    "i": 9, -    "j": 10, -    "k": 11, -    "l": 12, -    "m": 13, -    "n": 14, -    "o": 15, -    "p": 16, -    "q": 17, -    "r": 18, -    "s": 19, -    "t": 20, -    "u": 21, -    "v": 22, -    "w": 23, -    "x": 24, -    "y": 25, -    "z": 26, -} -a = [] -for i in range(len(n)): -    a.append(alphabet[n[i]]) -a.sort() -b = [] -for i in range(len(m)): -    b.append(alphabet[m[i]]) -b.sort(reverse=True) -for i in range(min(len(n), len(m))): -    if a[i] < b[i]: -        print("Yes") -        exit() -if len(n) < len(m): -    for i in range(len(n)): -        if a[i] > b[i]: -            print("No") -            exit() +n = sorted(eval(input())) +m = sorted(eval(input()), reverse=True) +if n < m: -    exit() -print("No") +else: +    print("No")