#include <iostream>
#include <cstdio>
#include <vector>
#include <string>
#include <array>
#include <queue>
#include <deque>
#include <set>
#include <list>
#include <map>
#include <stack>
#include <utility>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>
#include <climits>
#include <bitset>
#include <random>
#include <functional>
#include <sstream>
#include <iomanip>

using namespace std;

#define _CRT_SECURE_NO_WARNINGS
#define rep(i, n) for(int i=0; i<(n); i++)
#define FOR(i, m, n) for(int i=(m);i<(n);i++)
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define SORT(x) sort((x).begin(),(x).end())
#define REVE(x) reverse((x).begin(),(x).end())
#define mp make_pair
#define pb push_back

typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<vector<int>> VVI;
typedef pair<int, int> PII;
typedef long long LL;

LL waru(LL n) {
	int cnt = 0, m;
	if (n == 0)return 0;
	while (n % 10 == 0) {
		n /= 10;
		cnt++;
	}
	return cnt;
}

int main() {
	LL a, b;
	cin >> a >> b;

	LL a1 = a / (LL)(pow(10, waru(a))), b1 = b / (LL)(pow(10, waru(b)));
	//cout << a1 << " " << b1 << endl;
	if (waru(a) >= 2 && -9 <= a1 && a1 <= 9 && waru(b) >= 2 && -9 <= b1 && b1 <= 9) {
		cout << a * b / 10;
	}
	else {
		LL ans = a * b;
		if (abs(ans) > 99999999)puts("E");
		else cout << ans << endl;
	}
}