#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define LINF (ll)INF*INF
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,a,n) for(int i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,int> pii;
typedef vector<pii> vp;

int gcd(int a, int b){
    if(b==0) return a;
    return gcd(b,a%b);
}
int lcm(int a, int b){
    return a/gcd(a,b)*b;
}


signed main(void) {
    int a,b;
    cin >> a >> b;
    string s = to_string(a);
    string t = to_string(b);
    bool c = true;
    int p = 0, q = 0;
    if(!isdigit(s[0]))p++;
    if(!isdigit(t[0]))q++;
    if(s.size() < p + 3 || t.size() < q + 3)c = false;
    loop(i,1+p,s.size())if(s[i] != '0')c = false;
    loop(i,1+q,t.size())if(t[i] != '0')c = false;
    if(c){
        cout << a*b/10 << endl;
    }else{
        int ans = a*b;
        if(-99999999 <= ans && ans <= 99999999){
            cout << ans << endl;
        }else{
            cout << "E" << endl;
        }
    }
}