#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp> 
// #include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
// using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
 
typedef pair<ll, ll> pl;
typedef pair<ld,ld> pd;
typedef vector<ll> vl;
// typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
 
 
#define G(x) ll x; cin >> x;
#define F(i, l, r) for (ll i = l; i < (r); ++i)
#define all(a) begin(a), end(a)
#define K first
#define V second
#define OK(i,j) i >= 0 && i < n && j >= 0 && j < m
 
#define NN 2505
#define MM 5005
#define MOD 1000000007

struct frac{
    ll num = 0;
    ll denom = 1;

    frac operator+(frac a) {
        frac b;
        b.num = num*a.denom + a.num*denom;
        b.denom = denom*a.denom;
        b.reduce();
        return b;
    }

    frac operator*(frac a) {
        frac b;
        b.num = num*a.num;
        b.denom = denom*a.denom;
        b.reduce();
        return b;
    }

    void reduce() {
        ll g = gcd(num,denom);

        if(g == 0) return;

        num /= g;
        denom /= g;
    }

    pair<ll,frac> proper() {
        frac a;
        ll b;
        b = num/denom;
        a.num = num%denom;
        a.denom = denom;
        a.reduce();
        return {b,a};
    }
};

ll binpow(ll a, ll n) {
    if(n == 0) return 1;
    if(n == 1) return a;
    ll b = binpow(a,n/2);
    if(n%2 == 0) return b*b;
    else return b*b*a;
}

void solve() {
    string s;
    cin >> s;
    ll k = s.length();
    frac ans;
    ans.num = 0;
    ans.denom = 1;
    for(ll i=0;i<k;i++) {
        ll d = (ll)(s[i] - '0');
        frac a;
        a.num = d;
        a.denom = 1;
        frac b;
        b.num = binpow(3,k-i-1);
        b.denom = binpow(2,k-i-1);
        ans = ans + a*b;
    }

    pair<ll,frac> c = ans.proper();
    if(c.V.num == 0) cout << c.K << '\n';
    else cout << c.K << ' ' << c.V.num << '/' << c.V.denom << '\n';
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cout << fixed << setprecision(10);

    solve();

    return 0;

}