#pragma GCC optimize("O3") //#pragma GCC target("avx2") //#pragma GCC optimize("unroll-loops") #include using namespace std; typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef vector vi; typedef vector vll; typedef vector vld; typedef pair Pll; typedef pair Pin; ll INF = 1e16; int inf = 1e9; #define ALL(x) (x).begin(), (x).end() #define FOR(i, m, n) for (ll i = (m); i < (n); ++i) #define REVFOR(i, m, n) for (ll i = (n - 1); i >= (m); --i) #define REP(i, n) FOR(i, 0, n) #define REVREP(i, n) REVFOR(i, 0, n) #define fi first #define se second #define pb push_back #define mp make_pair #define eb emplace_back #define bcnt __builtin_popcountll #ifdef LOCAL #include #define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__); #else #define debug(...) 83; #endif void d_err() { cerr << endl; } template void d_err(H h, T... t) { cerr << h << " "; d_err(t...); } template void print(T x) { cout << x << "\n"; } template void print(vector& x) { int N = x.size(); REP(i, N) { if (i > 0) cout << " "; cout << x[i]; } cout << "\n"; } // return primes between [2, n] void SOE(ll n, vll& p) { vll s(n + 5); REP(i, s.size()) s[i] = i; p.eb(2); for (ll j = 4; j <= n; j += 2) { s[j] = 2; } for (ll i = 3; i <= n; i += 2){ if (s[i] != i) continue; p.pb(i); for (ll j = i+i; j <= n; j += i) { s[j] = i; } } } int main(){ cin.tie(0); ios_base::sync_with_stdio(false); cout << fixed << setprecision(20); string xin; cin >> xin; ll d = 1; int cmax = 0; ll x = 0; bool f = false; for (auto &e: xin) { if (e == '.') { f = true; continue; } x *= 10; x += e - '0'; if (f) d *= 10, cmax++; } int c2 = 0; while(x % 2 == 0 && c2 < cmax) { x /= 2; d /= 2; c2++; } int c5 = 0; while(x % 5 == 0 && c5 < cmax) { x /= 5; d /= 5; c5++; } cout << x; cout << "/"; cout << d; print(""); }