#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <fstream>

using namespace std;
#define TOSTRING(x) #x
#define SZ(x) (int)(x).size()
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define ALL(s) (s).begin(), (s).end()
#define so(V) sort(ALL(V))
#define rev(V) reverse(ALL(V))
#define uni(v) v.erase( unique(ALL(v)) , v.end());
#define PAU system("pause")

typedef long long unsigned int llu;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vector <int> > vvi;
const int EPS = 1e-9;
const int MOD = 1e9 + 7;
const int INF = (1 << 30);
const double PI = acos(-1);

vector<bool> VB;

void setVal(int n) {
	stringstream ss;
	ss << n;
	string s = ss.str();
	REP(i, SZ(s)) {
		VB[s[i] - '0'] = true;
	}
}


int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int A, B;
	cin >> A >> B;
	ll ans = 0;
	if (A % 100 == 0 && B % 100 == 0) {
		ans = A * B / 10;
		int zero = 0;
		while (A % 10 == 0) {
			zero++;
			A /= 10;
		}
		while (B % 10 == 0) {
			zero++;
			B /= 10;
		}
		cout << A * B;
		REP(i, zero-1) {
			cout << 0;
		}
		cout << endl;
	}
	else {
		ans = A * B;
		if (ans >= 100000000 || ans <= -100000000)cout << "E" << endl;
		else cout << ans << endl;
	}
	PAU;
	return 0;
}