#include <bits/stdc++.h>

using namespace std;

template <typename T>
int pow(int x, T n, int mod = std::numeric_limits<int>::max()) {
  int res = 1;
  while (n > 0) {
    if (n & 1) res = static_cast<int64_t>(res) * static_cast<int64_t>(x) % mod;
    x = static_cast<int64_t>(x) * static_cast<int64_t>(x) % mod;
    n >>= 1;
  }
  return res;
}

template <typename T>
int64_t pow(int64_t x, T n, int64_t mod = std::numeric_limits<int64_t>::max()) {
  int64_t res = 1;
  while (n > 0) {
    if (n & 1) res = static_cast<__int128>(res) * static_cast<__int128>(x) % mod;
    x = static_cast<__int128>(x) * static_cast<__int128>(x) % mod;
    n >>= 1;
  }
  return res;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int64_t A, B;
  cin >> A >> B;
  int n = 0, m = 0;
  while (A != 0 && A % 10 == 0) {
    A /= 10;
    n++;
  }
  while (B != 0 && B % 10 == 0) {
    B /= 10;
    m++;
  }
  auto check = [](int x) { return 0 < abs(x) && abs(x) < 10; };
  if (check(A) && check(B) && n > 1 && m > 1) {
    cout << A * B * pow(INT64_C(10), n + m - 1) << '\n';
  } else {
    int64_t c = A * B * pow(INT64_C(10), n + m);
    if (abs(c) >= 100000000) {
      cout << "E" << '\n';
    } else {
      cout << c << '\n';
    }
  }
  return 0;
}