#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<algorithm>
#include<cmath>
#include<climits>
#include<string>
#include<set>
#include<numeric>
#include<map>
#include<iostream>
using namespace std;
#define rep(i,n) for(int i = 0;i<((int)(n));i++)
#define reg(i,a,b) for(int i = ((int)(a));i<=((int)(b));i++)
#define irep(i,n) for(int i = ((int)(n)-1);i>=0;i--)
#define ireg(i,a,b) for(int i = ((int)(b));i>=((int)(a));i--)
typedef long long ll;
typedef pair<ll, ll> mp;
ll mod = 1e9+7;
ll inf = 1e18;

//WA

int main(void){
	string N;
	int a,b,c;
	cin>>N;
	c=N.size()-1;
	int last[4];
	rep(i,3)last[i]=N[i]-'0';
	if(last[2]>=5)last[1]++;
	if(last[1]>9){
		last[1]=0;
		last[0]++;
	}
	if(last[0]>9){
		a=1;
		b=0;
		c++;
	}else{
		a=last[0];
		b=last[1];
	}
	printf("%d.%d*10^%d\n",a,b,c);
}