#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll = long long;
#define int ll
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define ALL(a) (a).begin(), (a).end()
template <class t, class u> void chmax(t& a, u b) {
    if (a < b) a = b;
}
template <class t, class u> void chmin(t& a, u b) {
    if (b < a) a = b;
}
template <class t> using vc = vector<t>;
template <class t> using vvc = vc<vc<t>>;
using pi = pair<int, int>;
using vi = vc<int>;
using uint = unsigned;
using ull = unsigned long long;
int popcount(signed t) { return __builtin_popcount(t); }
int popcount(ll t) { return __builtin_popcountll(t); }
bool ispow2(int i) { return i && (i & -i) == i; }
ll mask(int i) { return (ll(1) << i) - 1; }
int lcm(int a, int b) { return a / __gcd(a, b) * b; }
vector<int> enum_divisors(int N) {
    vector<long long> res;
    for (long long i = 1; i * i <= N; ++i) {
        if (N % i == 0) {
            res.push_back(i);
            if (N / i != i) res.push_back(N / i);
        }
    }
    sort(res.begin(), res.end(), greater<int>());
    return res;
}
signed main() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout << fixed << setprecision(20);
    string x;
    cin >> x;
    if (x == "0") {
        cout << "0/1" << endl;
        return 0;
    }
    int p = 0;
    int l = x.length();
    rep(i, l) {
        if (x[l - 1 - i] == '.') {
            p = i;
        }
    }
    int bm = 1;
    rep(i, p) bm *= 10;
    string b;
    bool f = true;
    rep(i, l) {
        if (x[i] == '.') continue;
        b += x[i];
    }
    int bb = stoi(b);
    // cout << bm << " " << bb << endl;
    bool ff = true;
    while (ff) {
        int diff = abs(bm - bb);
        auto tmp = enum_divisors(diff);
        ff = false;
        for (auto u : tmp) {
            if (u == 1) continue;
            if (bm % u == 0 && bb % u == 0) {
                bm /= u;
                bb /= u;
                ff = true;
            }
        }
    }
    cout << bb << "/" << bm << endl;
}