#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
constexpr int INF = 1001001001;
// constexpr int mod = 1000000007;
constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    string s;
    cin >> s;
    int n = s.length();
    ll x = -1, ten = 1;
    for(int i = 0; i < n; ++i){
        if(s[i] == '.'){
            for(int j = 0; j < n - (i + 1); ++j){
                ten *= 10;
            }
            x = stoi(s.substr(0, i)) * ten + stoi(s.substr(i + 1, n - (i + 1)));
            break;
        }
    }
    if(x == -1) x = stoi(s);
    ll g = gcd(x, ten);
    cout << x / g << '/' << ten / g << '\n';

    return 0;
}