#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

ll gcd(ll a, ll b) {
	if (b == 0) return a;
	return gcd(b, a % b);
}

int main() {
	string X;
	cin >> X;
	auto pos = X.find('.');
	if (pos == string::npos) { cout << X << "/1" << endl; return 0; }
	ll num = stoi(X.substr(0, pos));
	ll denom = stoi(X.substr(pos + 1));
	int keta = X.size() - pos - 1;
	ll p = 1;
	REP(i, keta) p *= 10;
	num = num * p + denom;
	denom = p;
	ll g = gcd(num, denom);
	num /= g;
	denom /= g;
	cout << num << "/" << denom << endl;
}