#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <set>
#include <map>
#include <numeric>
#include <regex>
#include <tuple>
#include <iomanip>
#include <cmath>
using namespace std;

typedef long long ll;
typedef pair<int, int> P;
#define MOD 1000000007 // 10^9 + 7
#define INF 1000000000 // 10^9
#define LLINF 1LL<<60


int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	string S; cin >> S;
	int dig = S.size() - 1;
	int a = (S[0] - '0'); 
	int b = (S[1] - '0');
	int c = (S[2] - '0');

	//for(int i=0;i<3;i++) cout << S[i] << endl;

	if (c >= 5) b++;
	if (b == 10) {
		a++;
		b = 0;
	}
	if (a == 10) {
		a = 1;
		dig++;
	}

	cout << a << "." << b << "*10^" << dig << endl;

	return 0;
}