#include<iostream>
#include <bits/stdc++.h>

#define ll long long
#define IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
const int N = 1e6 + 5, mod = 998244353;


void doWork() {
    ll t, s;
    cin >> t >> s;
    ll ans1 = 1ll * (t + 1) * (t + 2) * 2 - (t + 1) * 4 + 1;
    ll ans2 = 0;

    for (ll x = 0; x <= s; x++) {
        ans2 += min(x, (s - x) * 2) + 1;
        ans2 += max(0ll, (2 * s - x) / 2 - x);
    }
    ans2 = ans2 * 4 - (s + 1) * 4 + 1;

    for (ll x = 0; x <= t; x++) {
        ll r = min(x, t - x);
        ll l = (s - x) * 2;
        ans1 -= max(0ll, r - l) * 4;

        r = min(x - 1, t - x);
        ans1 -= max(0ll, r - l) * 4;
    }
    if (t > s) {
        ans1 += (t - s) * 4;
    }

    ll g = __gcd(ans1, ans2);
    if (ans1 >= ans2) {
        cout << 1;
    } else {
        cout << ans1 / g << "/" << ans2 / g;
    }
}

int main() {
    IO
    int t = 1;
    //cin >> t;
    for (int i = 1; i <= t; i++) {
        //  cout << "Case #" << i << ": ";
        doWork();
    }
}