#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
#include <atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}

int main(){
  ll A,B; cin >> A >> B;
  ll AA = abs(A), BB = abs(B);
  string AS = to_string(AA), BS = to_string(BB);
  int flag=0;
  rep(i,sz(AS)-1){
    if(AS[i+1]!='0') flag=1;
  }
  rep(i,sz(BS)-1){
    if(BS[i+1]!='0') flag=1;
  }
  if(A==0||B==0) flag=1;
  if(flag){
    ll ans = A*B;
    if(abs(ans)>99999999) cout << "E" << endl;
    else cout << ans << endl;
  }
  else{
    ll ans = A*B;
    ans/=10;
    cout << ans << endl;
  }
  return 0;
}