#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}

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

  string S;
  cin>>S;
  int N=S.size();

  ll value=0;
  int ten=1;
  bool dw=false;
  rep(i,N){
    if(S[i]=='.'){
      dw=true;
      continue;
    }
    value=value*10+S[i]-'0';
    if(dw) ten*=10;
  }

  while(value%2==0&&ten%2==0){
    value/=2;
    ten/=2;
  }
  while(value%5==0&&ten%5==0){
    value/=5;
    ten/=5;
  }

  cout<<value<<"/"<<ten<<endl;

  return 0;
}