#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;

#define rep(i, init, end) for(ll i = init; i < end; i++)
#define REP(i, init, end) for(ll i = init; i < end + 1; i++)
#define rev(i, end, init) for(ll i = init - 1; i >= end; i--)
#define REV(i, end, init) for(ll i = init; i >= end; i--)
#define PI 3.14159265359
#define EPS 0.0000000001
// #define MOD 1000000007
//cout << std::fixed << std::setprecision(15) << y << endl;


ll gcd(ll a, ll b){
    return b != 0 ? gcd(b, a % b) : a;
}

int main(){
    string Xstr;
    cin >> Xstr;

    ll X = 0;
    ll denom = 1;
    bool foundPoint = false;
    rep(i, 0, Xstr.size()){
        if(Xstr[i] == '.'){
            foundPoint = true;
            continue;
        }
        if(!foundPoint){
            X *= 10;
            X += Xstr[i] - '0';
        }else{
            X *= 10;
            X += Xstr[i] - '0';
            denom *= 10;
        }
    }

    ll divider = gcd(X, denom);
    cout << X / divider << "/" << denom / divider << endl;

    return 0;
}