import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
write=sys.stdout.write

A,B=map(int,readline().split())
a=A
b=B
while a and a%10==0:
    a//=10
while b and b%10==0:
    b//=10
if 1<=abs(a)<=9 and A%100==0 and 1<=abs(b)<=9 and B%100==0:
    ans=A*B//10
else:
    ans=A*B
    if len(str(abs(ans)))>=9:
        ans="E"
print(ans)