#include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
using pii = pair<i64, i64>;
#define rep(i, n) for (i64 i = 0; i < (i64) n; i++)
#define per(i, n) for (i64 i = n - 1; i >= 0; i--)
#define REP(i, a, b) for (i64 i = a; i < (i64) b; i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
#ifdef LOCAL
#define dbg(...) cerr<<__LINE__<<" ["<<#__VA_ARGS__<<"]:",debug(__VA_ARGS__)
#else
#define dbg(...)
#endif
template <typename T> ostream& operator<<(ostream& os, const vector<T>& vec) {
    for (auto& x : vec) { os << x << ' '; } return os;
}
template <typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& mat) {
    os << endl; for (auto& vec : mat) { os << vec << endl; } return os;
}
template <typename T1, typename T2> ostream& operator<<(ostream& os, const pair<T1, T2>& pa) {
    os << '(' << pa.first << ',' << pa.second << ')'; return os;
}
void debug() { cerr << endl; }
template <typename Head, typename... Tail> void debug(Head H, Tail... T) {
    cerr << " " << H; debug(T...);
}
template <typename T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template <typename T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = (1 << 30) - 1;
const i64 LINF = (1LL << 62) - 1;

void solve() {
    string s;
    cin >> s;
    i64 u = -1, l = -1;
    int n = -1;
    rep(i, s.size()) {
        if (s[i] == '.') {
            n = s.size() - i - 1;
            string upper = s.substr(0, i), lower = s.substr(i + 1, n);
            u = stoll(upper);
            l = stoll(lower);
            break;
        }
    }
    if (u == -1) {
        cout << stoll(s) << "/1" << endl;
        return;
    }
    i64 ten = 1;
    rep(i, n) ten *= 10;
    u = u * ten + l;
    i64 g = gcd(u, ten);
    cout << u / g << "/" << ten / g << endl;
}

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