#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
char c[1000100];
deque<char> cc;
void solve() {
  int i, j = -1, k, n, m, l = 1, r, s = 0;
  n = strlen(c);
  i = 0;
  while (c[i] == '0') i++;
  while (i < n) {
    if (c[i] != '.') cc.push_back(c[i]);
    if (c[i] == '.') l = 0;
    s += l;
    i++;
  }
  while (cc.front() == '0') {
    s--;
    cc.pop_front();
  }
  while (cc.back() == '0') {
    cc.pop_back();
  }
  printf("%c", cc.front());
  cc.pop_front();
  if (cc.size() > 0) {
    printf(".");
    while (cc.size() > 0) {
      printf("%c", cc.front());
      cc.pop_front();
    }
  }
  if (s != 1) {
    printf("E%d", s - 1);
  }
}
int main() {
  int n, m, x, y, i, j, q = 0;
  while (gets(c)) {
    solve();
    printf("\n");
  }
  return 0;
}
