#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)

/*
オーバーフローには気を付けよう！
Inputs:
    string s : string representing a decimal number, such as 123.4, 0.123, 123.
    logn long shift_size : shift size, formally, this function return s * 10 ^ shift_size.
Output:
    Return s * 10 ^ shift_size as long long.
*/
long long str2dec(string s, long long shift_size) {
    auto pos = s.find('.');
    if(pos == string::npos) return atoll(s.c_str()) * pow(10LL, shift_size); // If s is an integer
    long long res = atoll(s.substr(0, pos).c_str()) * pow(10LL, shift_size); 
    res += atoll(s.substr(pos+1, s.size()-pos-1).c_str()) * pow(10LL, shift_size - (s.size()-pos-1));
    return res;
}


void solve() {
    string s;
    cin >> s;
    ll d = str2dec(s, 8);
    ll a = d;
    ll b = 100000000;
    ll g = gcd(a, b);
    a /= g; b /= g;
    cout << a << "/" << b << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}