#include <bits/stdc++.h>
using namespace std;
string s;
int epos;
int d, b;
deque<char> ans;
int main() {
  cin >> s;
  for (int i = 0; i < s.size(); i++) {
    if (s[i] == 'e') epos = i;
  }
  for (int i = epos - 1; i > 1; i--) {
    d += int(s[i] - '0') * pow(10.0, epos - 1 - i);
  }
  for (int i = s.size() - 1; i > epos; i--) {
    b += int(s[i] - '0') * pow(10.0, int(s.size()) - i - 1);
  }
  int index = -2;
  for (int i = 0; i < epos; i++) {
    if (s[i] == '.') {
      index++;
      continue;
    }
    if (index == b) {
      ans.push_back('.');
    }
    ans.push_back(s[i]);
    index++;
  }
  while (index < b) {
    ans.push_back('0');
    index++;
  }
  if (ans.front() == '0' && b == 0 && d == 0) {
    cout << '0';
    return 0;
  }
  if (b == 0 && d == 0) {
    cout << ans.front();
    return 0;
  }
  while (!ans.empty()) {
    cout << ans.front();
    ans.pop_front();
  }
  cin >> s;
  return 0;
}
