#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
const int MAXLEN = 1000000;
char s[MAXLEN + 1];
int len;
void run() {
  scanf("%s", s);
  len = strlen(s);
  int exp = 0;
  for (int i = (0); i < (len); ++i)
    if (s[i] == '.') {
      for (int j = (i + 1); j < (len); ++j) s[j - 1] = s[j], --exp;
      --len;
    }
  int a = 0;
  while (a < len && s[a] == '0') ++a;
  if (a >= len) {
    printf("0\n");
    return;
  }
  int b = len;
  while (b > a && s[b - 1] == '0') --b;
  printf("%c", s[a]);
  exp += len - a - 1;
  if (b > a + 1) {
    printf(".");
    for (int i = (a + 1); i < (b); ++i) printf("%c", s[i]);
  }
  if (exp != 0) printf("E%d", exp);
  puts("");
}
int main() {
  run();
  return 0;
}
