#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

int main() {
    string s;
    cin >> s;
    ll a = 0, b = 1, g = 0;
    for (auto &&i : s) {
        if(i == '.') g++;
        else {
            a = a*10+i-'0';
            if(g) b *= 10;
        }
    }
    g = __gcd(a, b);
    printf("%lld/%lld\n", a/g, b/g);
    return 0;
}