#pragma GCC optimize("Ofast")
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
#include<map>
#include<iomanip>
#include<queue>

const long long INF_L = 1e17+7;
const long long INF_I = 1e9+7;
const long long MOD = 1e9+7;
const double EPS = 1e-8;
const double PI=acos(-1);

using namespace std;

int keta(long long x){
	int sum=0;
	while(x){
		sum++;
		x/=10;
	}
	return sum;
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	long long a,b;
	cin >> a >> b;
	
	if(a%10==0 && b%10==0 && abs(a)>=100 && abs(b)>=100){
		cout << a*b/10 << endl;
		return 0;
	}
	
	if((100000000/abs(a)) <= abs(b)){
		cout << "E" << endl;
		return 0;
	}
	
	cout << a*b << endl;
	
	
			
	return 0;
}