#include <bits/stdc++.h>
const int mod = 1e9 + 7;
const int maxn = 1e6 + 5;
const double eps = 1e-6;
using namespace std;
bool eq(const double &a, const double &b) { return fabs(a - b) < eps; }
bool ls(const double &a, const double &b) { return a + eps < b; }
bool le(const double &a, const double &b) { return eq(a, b) || ls(a, b); }
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= mod;
  assert(b >= 0);
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
char s[maxn];
int main() {
  int d;
  scanf("%s", s);
  int len = strlen(s);
  int l = 0, r = len - 1;
  while (s[l] == '0' || s[l] == '.') l++;
  while (s[r] == '0' || s[r] == '.') r--;
  int pos = find(s, s + len, '.') - s;
  putchar(s[l]);
  if (l != r) putchar('.');
  for (int i = l + 1; i < (r + 1); ++i) {
    if (s[i] != '.') putchar(s[i]);
  }
  if (l < pos)
    d = pos - l - 1;
  else
    d = pos - l;
  if (d) printf("E%d", d);
  return 0;
}
