#include <bits/stdc++.h>
using namespace std;

#include  <ext/pb_ds/assoc_container.hpp>
#include  <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define x first
#define y second
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)

typedef long long ll;
typedef double db;
typedef long double LD;
typedef pair<int, int> pii;
typedef pair<db, db> pdd;
typedef pair<ll, ll> pll;


int solve()
{
	string s;
	if (!(cin >> s))
		return 1;
	
	vector<ll> pw2, pw3;
	pw2 = pw3 = {1};
	FOR (i, 0, 32)
	{
		pw2.pb(pw2.back() * 2);
		pw3.pb(pw3.back() * 3);
	}
	
	reverse(all(s));
	int n = sz(s);
	vector<ll> mn(n);
	ll num = 0, den = pw2[n - 1];
	FOR (i, 0, n)
	{
		mn[i] = (s[i] - '0') * pw3[i] * pw2[n - i - 1];
		num += mn[i];
		//den *= pw2[n - 1];
	}
	//den /= pw2[n - 1];
	//cerr << "num = " << num << " den = " << den << '\n';
	if (num % den == 0)
	{
		cout << num / den << '\n';
		return 0;
	}
	ll ful = num / den;
	num -= ful * den;
	ll g = __gcd(num, den);
	cout << ful << ' ' << num / g << '/' << den / g << '\n';
	
	return 0;
}

int32_t main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int TET = 1e9;
	//cin >> TET;
	for (int i = 1; i <= TET; i++)
	{
		if (solve())
		{
			break;
		}
		#ifdef ONPC
			cerr << "_____________________________\n";
		#endif
	}
	#ifdef ONPC
		cerr << "\nfinished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec\n";
	#endif
	return 0;
}