#include <iostream>
#include <algorithm>
#include <bitset>
#include <vector>
#include <cmath>
#include <string>
#include <set>
#include <map>
#include <unordered_map>
#include <sstream>
#include <iomanip>
#include <stdexcept>
#include <utility>
#include <deque>
using namespace std;
typedef long long ll;
typedef long double ld;

int gcd (int a, int b) {
    return b ? gcd (b, a % b) : a;
}

int main() {
    //these first two lines speed up input / output significantly
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    string seq;

    cin>>seq;

    
     if(seq.size()!= 0 ) {
        int denPow = seq.size()-1;

        ll num = 0;
        ll den = pow(2, denPow);

        for(int i = 0; i<seq.size(); i++) {
                int d = (seq[denPow-i]-'0');
                num+= d*(pow(3, i))*(pow(2, denPow-i));
        }

        ll whole = num/den;

        num = num%den;

        ll divis = gcd(num, den);

        num /= divis;
        den /= divis;

        if(num!= 0) {
            cout<<whole<<" "<<num<<"/"<<den;
        } else {
            cout<<whole;
        }
    }
    
    

}