#include <iostream>
#include <cstring>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <map>
#include <cmath>
#include <queue>
#include <utility>
#include <functional>
#include <deque>
#include <cctype>
#include <stack>
#include <bitset>

using ll = long long;
using namespace std;
typedef unsigned long long ull;
typedef pair<ll, ll>P;

ll gcd(ll a, ll b) {
	if (b == 0) return a;
	return gcd(b, a%b);
}
ll lcm(ll a, ll b) {
	ll g = gcd(a, b);
	return a / g * b;
}

const ll mod = 1000000007;
const ll INF = 1 << 30;
const ll INF2 = 9000000000000000000LL;
bool fl = true;
int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 };
string abc = "abcdefghijklmnopqrstuvwxyz";
struct edge { ll to, cost; };
struct edge1 { ll from, to, cost; };
double pai = 3.141592653589793;

int main() {
	int count = 0;
	string n;
	cin >> n;
	if (n[2] == '5' || n[2] == '6' || n[2] == '7' || n[2] == '8' || n[2] == '9') {
		if (n[1] == '9') {
			n[1] = '0';
			if (n[0] == '9') {
				n[0] = '1';
				count++;
			}
			else {
				n[0] = n[0] + 1;
			}
		}
		else n[1] = n[1] + 1;
	}
	for (int i = n.size() - 1;i > 0;i--) count++;
	cout << n[0] << '.' << n[1] << '*' << 10 << '^' << count << endl;
}