#include<bits/stdc++.h>

using namespace std;
 
typedef long long int ll;
typedef long double ld;
#define f first
#define s second
#define pb push_back
#define pii pair<int, int>

 
const int N = 2e5 + 100;
const int inf = 1e9;
const ll mod =  998244353;


ll p2[N], p3[N];

int main()
{
	string s;
	cin >> s;
	reverse(s.begin(), s.end());
	int n = s.size();
	p3[0] = p2[0] = 1;
	for(int i = 1; i < n; i++)
	{
		p3[i] = p3[i-1] * 3;
		p2[i] = p2[i-1] * 2;
	}
	ll N = 0, K = 0;	
	for(int i = 0; i < n; i++)
	{
		ll x = s[i] - '0';
		ll k = (p3[i]*x)/p2[i];
		N += k;
		ll A = p3[i]*x - k*p2[i];
		K = K*2 + A;
		N += K/p2[i];
		K -= (K/p2[i]) * p2[i];	
		//cout << (p3[i]*x)/p2[i] << ' ' << A << ' ' << p2[i] << endl; 	
		
	}
	cout << N << ' ';
	if(K != 0)
	{
		cout << K/gcd(K,p2[n-1]) << '/' << p2[n-1]/gcd(K,p2[n-1]);
	}				
	cout << endl; 
	
	
    return 0;
}