#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 15;
const int mod = 1e9 + 7;
const int inf = 1e9 + 3;
int t, n;
string a[3], s;
int flag;
int conv(string q) {
  int ans = 0;
  for (int i = 0; i < q.size(); i++) {
    ans *= 10;
    ans += q[i] - '0';
  }
  return ans;
}
int main() {
  cin >> s;
  for (int i = 0; i < s.size(); i++) {
    if (s[i] == '.' || s[i] == 'e')
      t++;
    else
      a[t] += s[i];
  }
  for (int i = a[1].size() - 1; i >= 0; i--) {
    if (a[1][i] == '0')
      flag++;
    else
      break;
  }
  cout << a[0];
  n = conv(a[2]);
  for (int i = 0; i < a[1].size() - flag; i++) {
    if (n == 0) cout << '.';
    n--;
    cout << a[1][i];
  }
  while ((n--) > 0) cout << 0;
  cout << endl;
}
