#include<cstdio>
#include<algorithm>
using namespace std;

int main(){
	int a,b;
	scanf("%d%d",&a,&b);
	int c=6-max(a,b)+1;
//	printf("%d\n",c);
	if (c==0){
		printf("0/1");
		return 0;
	}
	if (c==6){
		printf("1/1");
		return 0;
	}
	printf("%d/%d",c/__gcd(c,6),6/__gcd(c,6));
	return 0;
}

#include<iostream>  //或万能头（bits/stdc++.h)
using namespace std;
int main(){
    int a,b,c;
    cin>>a>>b;
    c=max(a,b);
    if(c==1)
        cout<<"1/1";
    if(c==6)
        cout<<"1/6";
    if(c==5)
        cout<<"1/3";
    if(c==4)
        cout<<"1/2";
    if(c==3)
        cout<<"2/3";
    if(c==2)
        cout<<"5/6";
    return 0;
}

#include<bits/stdc++.h>
#define t break;
using namespace std;
int main()
{
	int a,b,s;
	cin>>a>>b;
	if(a<b) swap(a,b);
	switch(a)
	{
		case 6:cout<<"1/6";t
		case 5:cout<<"1/3";t
		case 4:cout<<"1/2";t
		case 3:cout<<"2/3";t
		case 2:cout<<"5/6";t
		case 1:cout<<"1/1";t
	}
}

#include<stdio.h>
int GCD(int a, int b)
{
    int temp;
    while(b!=0){
        temp = b;
        b = a%b;
        a = temp;
    }
    return a;
}
int main()
{
    int Y, W;
    scanf("%d %d", &Y, &W);
    int max;
    if(Y>W){
        max = Y;
    }
    else{
        max = W;
    }
    //printf("1/%d\n", 6-max);
    int d = (6 - max) + 1;
    int x, y, z;
    if(d==0){
        printf("0/1\n");
        return 0;
    }
    else{
        int gcd = GCD(d,6);
        x = 6/gcd;
        y = d/gcd;
        printf("%d/%d\n", y, x);
        return 0;
        //return 0;
    }

    return 0;
}

#include <iostream>
#include <cstdlib>
using namespace std;

int main()
{
    int a,b,z=0;
    cin>>a>>b;
    int c=(a>b)?a:b;
    for(int i=1;i<=6;i++)
    {
        if(i>=c){z++;}
    }
    if(z==0){cout<<"0/1";}
    else if(z==1){cout<<"1/6";}
    else if(z==2){cout<<"1/3";}
    else if(z==3){cout<<"1/2";}
    else if(z==4){cout<<"2/3";}
    else if(z==5){cout<<"5/6";}
    else{cout<<"1/1";}
    return 0;
}

//
//  main.cpp
//  C0DEF0RCE$
//
//  Created by ABDELRAHM@N N@$$ER.
//  Copyright © 2020 Abdelrahm@n N@$$ER. All rights reserved.
//
// #include "stdc++.h"
#include <bits/stdc++.h>
using namespace std;

// DataType Shortcuts
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<char> vc;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

// Looping Shortcuts
#define FORR(i, a, b) for (int i=a; i<(b); i++)
#define FOR(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a,x) for (auto& a : x)

// Looping Shortcuts
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define ins insert

// ----------------------- // -------------------- //

int main() {
    int s;
    int c;
    int res;
    cin>>s;
    cin>>c;
    int num;
    num = 7 - max(s,c);
    res = 6;
    if (num == res){
        num = 1; res = 1;
    }else if(num%2==0){
        num = num/2; res = res/2;
    }else if( num % 3 == 0){
        num = num/3; res = res/3;
    }else {

    }
    cout<<num<<"/"<<res<<endl;
    return 0;
}

#include<bits/stdc++.h>
#include<cmath>
using namespace std;
unsigned long long m,n;
int main(){
	cin>>m>>n;
	m=max(m,n);
	if(m==1) printf("1/1");
	else if(m==2) printf("5/6");
	else if(m==3) printf("2/3");
	else if(m==4) printf("1/2");
	else if(m==5) printf("1/3");
	else if(m==6) printf("1/6");
	return 0;
}

#include<iostream>
#include<string>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
using namespace std;
int main(){
	std::ios_base::sync_with_stdio(0);
	cin.tie(NULL);
	cout.tie(NULL);
	int n, k;
	cin >> n >> k;
	int b = max(n, k);
	int dot= 6 - b +1;

	switch (dot)
	{
	case 1:
		cout << 1 << "/" << 6 << endl;
		break;

	case 2:
		cout << 1 << "/" << 3 << endl;
		break;
	case 3:
		cout << 1 << "/" << 2 << endl;
		break;
	case 4:
		cout << 2 << "/" << 3 << endl;
		break;
	case 5:
		cout << 5 << "/" << 6 << endl;
		break;
	case 6:
		cout << 1 << "/" << 1 << endl;
		break;

	default:
		cout << 0 << "/" << 0 << endl;
	}

	return 0;
}

//by JS

#include <bits/stdc++.h>

using namespace std;

void solve() {
    int y, w;
    cin >> y >> w;
    int zi = 6 - max(y, w) + 1;
    int mu = 6;
    if (__gcd(mu, zi) != 1) {
        int GCD = __gcd(mu, zi);
        zi /= GCD;
        mu /= GCD;
    }
    cout << zi << '/' << mu << '\n';
}

int main() {
    solve();
    return 0;
}

#include <iostream>
using namespace std;
int main()
{
	int y, w, ans;
	cin >> y >> w;
	ans = (y > w) ? (7 - y) : (7 - w);
	if (ans == 1) cout << "1/6" << endl;
	else if (ans == 2) cout << "1/3" << endl;
	else if (ans == 3) cout << "1/2" << endl;
	else if (ans == 4) cout << "2/3" << endl;
	else if (ans == 5) cout << "5/6" << endl;
	else cout << "1/1" << endl;
	return 0;
}

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <utility>
using namespace std;
int main()
{
	int y, w, numerator=0, denominator=6;
	cin >> y >> w;
	if (y>w)
	{
		for (int i=y;i<=6;i++)
		{
			numerator++;
		}
	}
	else
	{
		for (int i = w; i <= 6; i++)
		{
			numerator++;
		}
	}
	if (denominator%numerator==0)
	{
		denominator = denominator / numerator;
		numerator /= numerator;
	}
	if (numerator==4)
	{
		denominator /= 2;
		numerator /= 2;
	}
	cout << numerator << "/" << denominator;
	return 0;
}

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

int main()
{
    int a,b,c,d,e;
    cin>>a>>b;
    d=max(a,b);
       if(d==1)
        cout<<"1/1";
       else if (d==2)
       {
           cout<<"5/6";
       }
       else if (d==3)
       {
           cout<<"2/3";
       }
       else if (d==4)
       {
           cout<<"1/2";
       }
       else if (d==5)
       {
           cout<<"1/3";
       }
       else
       {
           cout<<"1/6";
       }
}

#include<bits/stdc++.h>
using namespace std;
int a,b,maxn,to6;
int main()
{
    cin>>a>>b;
    maxn=max(a,b);
    for(int s=maxn;s<=6;s++)
    {
        to6++;
    }
    cout<<to6/(__gcd(to6,6))<<"/"<<6/(__gcd(to6,6));
}

//界面未成功上报

#include <iostream>
using namespace std;
int main()
{
    int n,m,max,flag,sum=6;
    cin>>n>>m;
    flag=0;
    if(n>=m)
        max=n;
    else
        max=m;
    for(int i=max; i<=6; i++)
    {
        flag++;
    }
    if(flag)
    {
        for(int i=2; i<=6; i++)
            if(flag%i==0&&sum%i==0)
            {
                flag=flag/i,sum=sum/i;
            }
        cout<<flag<<"/"<<sum<<endl;
    }

    else
        cout<<"0/1"<<endl;
    return 0;
}

#include <iostream>
#include <string>
#include <math.h>
#include <map>
#include <algorithm>
#include <vector>
#define Loop int loop = 0; loop < t; ++loop
#define LoopN int i = 0; i < n; ++i
#define LoopM int j = 0; j < m; ++j
#define ll long long
#define Mod1 1000000007
#define Mod2 998244353
using namespace std;

int main()
{
	int x,y;
	cin >> x >> y;
	if(x<y)x=y;
	switch(x)
	{
	case 1: cout << "1/1\n"; break;
	case 2: cout << "5/6\n"; break;
	case 3: cout << "2/3\n"; break;
	case 4: cout << "1/2\n"; break;
	case 5: cout << "1/3\n"; break;
	case 6: cout << "1/6\n"; break;
	}
}

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<math.h>
#include<string>
#include<string.h>
#include<iostream>
#include<vector>
#include<set>
#include<algorithm>
#include<functional>
#include<utility>
#include<iomanip>
#include<time.h>
#include<queue>
#include<map>
#include<stack>
#include<limits.h>
#include<fstream>
#include<filesystem>
using namespace std;

//fast types
#define vi vector<int>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double dd;

/*primes in range 1 - n
1 - 100(1e2) -> 25 primes
1 - 1000(1e3) -> 168 primes
1 - 10000(1e4) -> 1229 primes
1 - 100000(1e5) -> 9592 primes
1 - 1000000(1e6) -> 78498 primes
1 - 10000000(1e7) -> 664579 primes
large primes ->
104729 1299709 15485863 179424673 2147483647 32416190071 112272535095293
*/

//defines
#define read(f)    freopen(f, "r", stdin)
#define write(f)   freopen(f, "w", stdout)
#define fast  std :: ios :: sync_with_stdio ( false )
#define scd(a) scanf("%d",& a)
#define scdd(a,b) scanf("%d%d",& a,& b)
#define mp make_pair

//constants
#define pi 3.141592653589793238462643383279
#define rad 57.295779513082320876798154814105170332405

namespace Help
{
	int mod = 1;
	int safe_mul(int a, int b)
	{
		return a * (ll)b % mod;
	}
	int safe_exp(int a, int b)
	{
		int rez = 1;
		for (; b > 0; b >>= 1)
		{
			if (b & 1)
				rez = safe_mul(rez, a);
			a = safe_mul(a, a);
		}
		return rez;
	}
	vector<string> split(string s, char c)
	{
		vector<string> ss;
		ss.push_back("");
		int last = 0, ptr = 0, k = 0;
		for (int i = 0; i < s.length(); i++)
		{
			if (s[i] == c)
			{
				last = i;
				break;
			}
			ss[0] += s[i];
		}
		if (ss[0].length() != s.length())
		{
			ptr = last;
			ptr++;
			while (ptr < s.length())
			{
				k++;
				ss.push_back("");
				while (ptr != s.length())
				{
					if (s[ptr] == c)
					{
						ptr++;
						break;
					}
					ss[k].push_back(s[ptr]);
					ptr++;
				}
			}
		}
		return ss;
	}
	long long gcd(long long a, long long b)
	{
		while (a != 0 && b != 0)
		{
			if (a > b)
				a %= b;
			else
				b %= a;
		}
		return a + b;
	}
	bool isPrime(long long a)
	{
		long long i;
		if (a % 2 == 0)
			return 0;
		else
			for (i = 3; i * i <= a; i += 2)
				if (a % i == 0)
					return 0;
		return 1;
	}

};
int main() {
	int a, b;
	cin >> a >> b;
	int y = max(a, b);
	y = 7 - y ;
	int g = Help::gcd(6, y);
	if (y == 0){
		cout << "0/1";
	}
	else {
		cout << y / g << "/" << 6 / g;
	}
    return 0;
}
/* Fri Apr 10 2020 21:09:07 GMT+0300 (MSK) */

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

using namespace std;

int main()
{
 int y,w,tot = 6,mx,i;
    scanf("%d%d",&y,&w);
    mx = max(y,w);
    int Dotchance = tot - mx + 1 ;
    for(i = 6 ; i > 0 ; i--) {
        if(Dotchance % i == 0 and tot % i == 0) {
            tot = tot / i;
            Dotchance = Dotchance / i ;
        }
    }
    printf("%d/%d\n",Dotchance,tot);

    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int n,m;
	cin>>n>>m;
	int s=max(n,m);
	int ans=7-s;
	if(ans==1) cout<<"1/6";
	else
	if(ans==2) cout<<"1/3";
	else
	if(ans==3) cout<<"1/2";
	else
	if(ans==4) cout<<"2/3";
	else
	if(ans==5) cout<<"5/6";
	else
	if(ans==6) cout<<"1/1";
}

#include<iostream>
#include<algorithm>
using namespace std;

int main() {
	int w, y, d;

	cin >> y >> w;
	d = 6 - max(y, w) + 1;
	switch (d){
	case 1:
		cout << "1/6";
		break;
	case 2:
		cout << "1/3";
		break;
	case 3:
		cout << "1/2";
		break;
	case 4:
		cout << "2/3";
		break;
	case 5:
		cout << "5/6";
		break;
	case 6:
		cout << "1/1";
		break;
	}

	return 0;
}

#include <iostream>
#include <cmath>
#include <string>
#include <iomanip>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <cctype>
#include <set>

using namespace std;

typedef unsigned int ui;
typedef long long int lli;
typedef long double ld;
typedef unsigned long long int ulli;

template<class TypeName>void print(TypeName value) {
	cout << value << " ";
}
template<class TypeName>void println(TypeName value) {
	cout << value << endl;
}

bool isPrime(ui value) {
	if (value < 2) return false;
	if (value == 2) return true;
	for (ui i = 2; i <= sqrt(value); i++) {
		if (value % i == 0) {
			return false;
		}
	}
	return true;
}

ulli* seive() {
	const ulli lim = 20000000;
	ulli arr[lim] = {};
	for (ulli i = 2; i < sqrt(lim); i++) {
		if (!arr[i]) {
			for (ulli j = i * i; j < lim; j += i) {
				arr[j] = 1;
			}
		}
	}

	return arr;
}

ulli reverse(ulli value) {
	ulli temp = 0;
	while (value) {
		temp = temp * 10 + (value % 10);
		value /= 10;
	}
	return temp;
}

vector<ulli> primeFactors(ulli value) {
	vector<ulli> vec;
	for (ulli i = 2; i < value; i++) {
		if (isPrime(i)) {
			while (value % i == 0) {
				vec.push_back(i);
				value /= i;
			}
		}
	}
	if(value !=1)
		vec.push_back(value);
	return vec;
}

int main() {

	//97 - 122
	//48 - 57
	//65 - 90
	cout << fixed;
	cout << setprecision(0);

	ios::sync_with_stdio(0);
	cin.tie(0);

	cout << fixed;
	cout << setprecision(0);

	ios::sync_with_stdio(0);
	cin.tie(0);

	ui a, b;

	cin >> a >> b;

	ui n, d;

	if (a >= b) {
		n = 6 - a;
		d = 6;
	}
	else {
		n = 6 - b;
		d = 6;
	}
	n++;

	while (d % n == 0 && n > 1) {
		d /= n;
		n /= n;
	}

	if (n == 4) {
		n = 2;
		d = 3;
	}

	cout << n << "/" << d << endl;

	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int gy(int a,int b){
	int p=0;
	p=min(a,b);
	for(int i=p;;i--)
	if(a%i==0&&b%i==0)
	return i;
}
int main()
{
	int a,b,s1=0,s2=0;
	cin>>a>>b;
	a=max(a,b);
	a=7-a;
	b=gy(a,6);
	s1=a/b;
	s2=6/b;
	cout<<s1<<"/"<<s2;
	return 0;
}

#include<iostream>
using namespace std;
int gcd(int x,int y){
	if (y==0)  return  x;
    else return gcd(y,x%y);
}
int main(){
	int x,y;
	cin>>x>>y;
	int p=max(x,y);
	if(p==1){
		cout<<"1/1";
		return 0;
	}
	int q=gcd(6,6-p+1);
	p=6-p+1;
	cout<<p/q<<"/"<<6/q;
}

#include <bits/stdc++.h>
#include <cstring>
#include <algorithm>

using namespace std;

int n,m,a,b;
int main() {
	cin>>n>>m;
	b=6;
	a=6-max(n,m)+1;
	int c = __gcd(a,b);
	a/=c;
	b/=c;
	cout<<a<<'/'<<b;
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
int main ()
{
	int a,b;
	cin>>a>>b;
	int c;
	if (a>=b)
	{
		c=6-a+1;
	}
	else
	{
		c=6-b+1;
	}
	switch (c)
	{
		case 1: cout<<"1/6"; break;
		case 2: cout<<"1/3"; break;
		case 3: cout<<"1/2";break;
		case 4: cout<<"2/3"; break;
		case 5: cout<<"5/6"; break;
		case 6: cout<<"1/1"; break;
	}
	return 0;
}

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

int main()
{
    int n, m;
    cin >> n >> m;
    int s = max(n, m);
    int ans = 7 - s;
    if(ans == 1) cout << "1/6";
    else
    if(ans == 2) cout << "1/3";
    else
    if(ans == 3) cout << "1/2";
    else
    if(ans == 4) cout << "2/3";
    else
    if(ans == 5) cout << "5/6";
    else
    if(ans == 6) cout << "1/1";
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int gcd(int a,int b){ return b==0?a:gcd(b,a%b); }

int main()
{
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	int a,b,c,ans,cnt,tmp;
	cin>>a>>b;
	c=max(a,b);
	ans=6-c+1;
	cnt=gcd(ans,6);
	printf("%d/%d",ans/cnt,6/cnt);
    return 0;
}

/*(^-^)*/
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<cmath>
#include<ctime>
#include<cstdio>
#include<vector>
#include<cctype>
#include<string>
#include<iomanip>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define ll long long
ll a,b,sum=6;
ll gcd(ll a,ll b){return (b==0)?a:gcd(b,a%b);}

int main()
{
	scanf("%lld %lld",&a,&b);
	sum=sum+1-max(a,b);
	if(sum==6){printf("1/1");return 0;}
	else if(sum==0){printf("0/1");return 0;}
	else printf("%lld/%lld",sum/gcd(sum,6),6/gcd(sum,6));
	return 0;
}

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
struct FENSHU
{
	int fenz;
	int fenm;
};
int MAXI(int a,int b)
{
	if(a==0)
		return b;
	if(b==0)
		return a;
	return MAXI(b,a%b);
}
void yuefen(FENSHU &f)
{
	int r=MAXI(f.fenz,f.fenm);
	f.fenz/=r;
	f.fenm/=r;
	return;
}
ostream & operator<<(ostream & os,FENSHU & mat) {
    	os << mat.fenz<<"/"<<mat.fenm;
    return os;
}
int main()
{
 	FENSHU fs;
 	int a,b;
 	cin>>a>>b;
 	fs.fenz=6-((max(a,b)-1)>=0?max(a,b)-1:0);
 	fs.fenm=6;
 	yuefen(fs);
 	cout<<fs;
	return 0;
}

#include <string>
#include <iostream>
using namespace std;
int main() {
	int p1, p2;
	string aray[] = { "", "1/1","5/6","2/3","1/2","1/3","1/6" };
	cin >> p1 >> p2;
	if (p2 > p1)p1 = p2;
	cout << aray[p1];
}

#include<bits/stdc++.h>
using namespace std;
int main(){
	int a,b,o,i,j,q;
	cin>>a>>b;
	if(a>b) {o=a;}
	else {o=b;}
	i=7-o;
	for(j=1;j<=i;j++) {
		if(i%j==0&&6%j==0) {q=j;}
	}
	i=i/q;
	int u;
	u=6/q;
	cout<<i<<"/"<<u;
	return 0;
}

#include<iostream>
using namespace std;
int main()
{
	int y, w, a[6], b = 0, n = 0, c = 1;
	cin >> y >> w;
	if (w >= y)
	{
		n = w;
	}
	else
	{
		n = y;
	}
	for (int i = n; i <= 6; i++)
	{
		a[b] = i;
		b++;
	}
	if (b == 4)
	{
		cout << "2/3" << endl;
	}
	else if (b == 3)
	{
		cout << "1/2" << endl;
	}
	else if (b == 2)
	{
		cout << "1/3" << endl;
	}
	else if (b == 1)
	{
		cout << "1/6" << endl;
	}
	else if (b == 5)
	{
		cout << "5/6" << endl;
	}
	else if (b == 6)
	{
		cout << "1/1" << endl;
	}
	else
	{
		cout << "0/1" << endl;
	}
}

#include <bits/stdc++.h>
using namespace std;
long long int a,b,sum=0;
int main()
{
	cin>>a>>b;
	sum=max(a,b);
	if(sum==1)
	{
	cout<<"1/1";
	//cout<<sum;
	}
	if(sum==6)
	{
		cout<<"1/6";
	}
	if(sum==5)
	{
		cout<<"1/3";
	}
	if(sum==4)
	{
		cout<<"1/2";
	}
	if(sum==3)
	{
		cout<<"2/3";
	}
	if(sum==2)
	{
		cout<<"5/6";
	}
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int a,b,ans1=0,ans2=0;
int main(){
	cin>>a>>b;
	a=max(a,b);
	for(int i=1;i<=6;i++){
		if(i>=a)
		ans1++,ans2++;
		if(i<a)
		ans2++;
	}
	int x=__gcd(ans1,ans2);
	if(ans1==0){cout<<0<<"/"<<1;return 0;}
	else if(ans1==ans2){cout<<1<<"/"<<1;return 0;}
	else cout<<ans1/x<<"/"<<ans2/x;
}

#include<bits/stdc++.h>
using namespace std;
int gcd(int a,int s){
	if(s==0) return a;
	return gcd(s,a%s);
}
int main(){
    int a,s;
    cin>>a>>s;
    int n=6-max(a,s)+1;
    int k=gcd(n,6);
    cout<<n/k<<"/"<<6/k;
	return 0;
}

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

// int gcd(int a, int b) //recursive not good
// {
//     if(a==0)
//         return b;
//     return gcd(b%a, a);
// }

int gcd(int a, int b)
{
    while(a!=0)
    {
        b=a; a=b%a;
    }
    return b;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int x, y;
    cin>>x>>y;

    int ans=6-max(x, y)+1;
    int g=__gcd(6,ans);
    cout<< ans/g<<"/"<<6/g;

    // switch (ans)
    // {
    // case 0:
    //     cout<<"0/6";
    //     break;
    // case 1:
    //     cout<<"1/6";
    //     break;
    // case 2:
    //     cout<<"1/3";
    //     break;
    // case 3:
    //     cout<<"1/2";
    //     break;
    // case 4:
    //     cout<<"2/3";
    //     break;
    // case 5:
    //     cout<<"5/6";
    //     break;
    // case 6:
    //     cout<<"1/1";
    //     break;

    // default:
    //     break;
    // }

    return 0;
}

#include<iostream>
#include<string>
#include<algorithm>
#include<math.h>
#include<functional>
#include<iomanip>
using namespace std;

int main ()
{
	int x , y ;
	cin >> x >> y ;
	if ( x == 1 && y == 1 )
	{
		cout << 1 << '/' << 1 << endl ;
		return 0 ;
	}
	if ( y >= x )
		x = y ;
	x = 7 - x ;
	if ( x == 1 )
		cout << 1 << '/' << 6 << endl ;
	else if ( x == 2 )
		cout << 1 << '/' << 3 << endl ;
	else if ( x == 3 )
		cout << 1 << '/' << 2 << endl ;
	else if ( x == 4 )
		cout << 2 << '/' << 3 << endl ;
	else if ( x == 5 )
		cout << 5 << '/' << 6 << endl ;
	else if ( x == 6 )
		cout << 1 << '/' << 1 << endl ;
	return 0 ;
}

#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <iomanip>
#include <iterator>

using namespace std;

const int mod = 1e9 + 7;

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

int safe_mul (int x, int y) {
    return x * 1ll * y % mod;
}

int safe_pow (int x, int y) {
    int res = 1;
    for (; y > 0; y >>= 1) {
        if (y & 1)
            res = safe_mul (res, x);
        x = safe_mul (x, x);
    }
    return res;
}

int main() {
    int y, w;
    cin >> y >> w;

    int x = 7 - max (y, w);
    int g = gcd (x, 6);

    cout << x / g << "/" << 6 / g;

    return 0;
}

/* Fri Jul 19 2019 10:58:20 GMT+0300 (MSK) */

#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<string>
#include<cstdlib>
#include<algorithm>//文件头不解释
using namespace std;
int y,w;
int maxs,pd;//定义变量
int main()
{
cin>>y>>w;//读入小Y和小W的得分
maxs=max(y,w);//求最大值
pd=6-maxs;//我后面再加1
if(pd+1==1)cout<<"1/6";//自行理解
if(pd+1==2)cout<<"1/3";//自行理解
if(pd+1==3)cout<<"1/2";//自行理解
if(pd+1==4)cout<<"2/3";//自行理解
if(pd+1==5)cout<<"5/6";//自行理解
if(pd+1==6)cout<<"1/1";//自行理解
return 0;
}

#include <iostream>
using namespace std;

int gcd(int a, int b) {
    while (a != b) {
        if (a > b) a = a - b;
        else b = b - a;
    }
    return a;
}

int main(int argc, char const *argv[])
{
    int a, b;
    cin >> a >> b;

    int z = 6 - max(a,b) + 1;

    cout << z / gcd(6, z) << "/" << 6 / gcd(6, z);

    return 0;
}

#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
    int a,b,n,d;
    cin>>a>>b;
    n=6-max(a,b)+1;
    d=6;
    if(n/d==1)
    cout<<"1/1";
    else
    {
        switch(n)
        {
            case 5:
            cout<<"5/6";
            break;

            case 4:
            cout<<"2/3";
            break;

            case 3:
             cout<<"1/2";
             break;

            case 2:
            cout<<"1/3";
            break;

            case 1:
            cout<<"1/6";
            break;

        }
    }

}

/*
**************
*   Good     *
*  Luck!!!   *
*            *
**************
*/
#include<iostream>
#include<stdio.h>
#include<set>
#include<map>
#include<stdlib.h>
#include<ctime>
#include<memory.h>
#include<vector>
#include<math.h>
#include<deque>
#include<stack>
#include<list>
#include<queue>
#include<algorithm>
#include<string>
#include<string.h>
#include<cmath>
#include<fstream>
#include<iomanip>
//#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define db double
#define file "file"
#define int long long
//#define M_PI 3.1415926535897931
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef map<int, int> mpi;
typedef set<int, int> sti;

const int maxN = 1e5;
const int INF = 1e9;
const int eps = 1e-9;
const int inf = -INF;
const int base = 1000 * 1000 * 1000;
const int mod = 1e9 + 7;
typedef ll mass[maxN + 1];

int readInt ()
{
    bool minus = false;
    int result = 0;
    char ch;
    ch = getchar();
    while (true)
    {
        if (ch == '-') break;
        if (ch >= '0' && ch <= '9') break;
        ch = getchar();
    }
    if (ch == '-') minus = true;
    else result = ch-'0';
    while (true)
    {
        ch = getchar();
        if (ch < '0' || ch > '9') break;
        result = result*10 + (ch - '0');
    }
    if (minus)
        return -result;
    else
        return result;
}
struct pt
{
    int x, y;
};
bool comp(pt a, pt b)
{
    return a.x < b.x || (a.x == b.x && a.y < b.y);
}
ll gcd(ll a, ll b)
{
    return b ? gcd(b, a % b) : a;
}
ll lcm(ll a, ll b)
{
    return a / gcd(a, b) * b;
}
ll binary_power(ll a, ll n)
{
    ll res = 1;
    while(n > 0)
    {
        if(n % 2 == 0)
        {
            a *= a;
            n >>= 1;
        }
        else
        {
            res *= a;
            n--;
        }
    }
    return res;
}
int bitCount(ll n)
{
    return __builtin_popcount(n);
}
int LowerBound(int L, int R, int x, ll w[])
{
    // L = 0, R = n
    while(R - L > 1)
    {
        int mid = (L + R) >> 1;
        if(w[mid] >= x)
            R = mid;
        else
            L = mid;
    }
    if(w[R] == x)
        return R;
    return -1;
}
int UpperBound(int L, int R, int x, ll w[])
{
    // L = 1, R = n + 1
    while(R - L > 1)
    {
        int mid = (L + R) >> 1;
        if(w[mid] <= x)
            L = mid;
        else
            R = mid;
    }
    if(w[L] == x)
        return L;
    return -1;
}
db dis(db x1, db y1, db x2, db y2);
double triangle_area (int x1, int y1, int x2, int y2, int x3, int y3) ;
int triangle_area_2 (int x1, int y1, int x2, int y2, int x3, int y3) ;
ll n,m;
main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    //freopen(file".in", "rt", stdin);
    //freopen(file".out", "wt", stdout);
    cin >> n >> m;
    ll col = 6;
    ll nod = 6 - max(n,m) + 1;
    cout << nod / gcd(col,nod) << "/" << col / gcd(col,nod);
    return 0;
}
db dis(db x1, db y1, db x2, db y2)
{
    return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
int triangle_area_2 (int x1, int y1, int x2, int y2, int x3, int y3) {
        return (x2 - x1) * (y3 - y1) - (y2 - y1) * (x3 - x1);
}
double triangle_area (int x1, int y1, int x2, int y2, int x3, int y3) {
        return abs (triangle_area_2 (x1, y1, x2, y2, x3, y3)) / 2.0;
}
//

/*****************************************************************************
 * codeforces:   knst
 * topcoder:     knstqq
 * projecteuler: knstqq
 * **************************************************************************/

#include <algorithm>
#include <iostream>
#include <limits>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <vector>

using namespace std;
//test speed
/*
namespace std {
    template <class T1, class T2>
    class hash<pair<T1, T2>> {
    public:
        size_t operator()(const pair<T1, T2>& p) const {
            return hash<T1>()(p.first) & hash<T2>()(p.second);
        }
    };
}; */
namespace std {
    template <>
    class hash<pair<long long,long long>> {
    public:
        size_t operator()(const pair<long long, long long>& p) const {
            return hash<long long>()(p.first) ^ (hash<long long>()(p.second) << 32);
        }
    };
};

constexpr long double const_pi() { return std::atan(static_cast<long double>(1))*4; }

const int dx4[] = {-1, 0, 1, 0};
const int dy4[] = {0, -1, 0, 1};

const int dx8[] = {-1, -1, -1, 0, 0, 1, 1, 1};
const int dy8[] = {-1, 0, 1, -1, 1, -1, 0, 1};

int main() {
    std::ios_base::sync_with_stdio(false);

    int n;
    int m;
    cin >> n >> m;
    int v = max(n, m);
    switch (v) {
        case 1:
            cout << "1/1" << endl;
            break;
        case 2:
            cout << "5/6" << endl;
            break;
        case 3:
            cout << "2/3" << endl;
            break;
        case 4:
            cout << "1/2" << endl;
            break;
        case 5:
            cout << "1/3" << endl;
            break;
        case 6:
            cout << "1/6" << endl;
            break;
    }

    return 0;
}

#include <iostream>
#include <stdio.h>
using namespace std;

int main()
{
    int a, b, m;
    cin>>a>>b;

    m = (a > b ? a : b);

    (m < 6) ? ((m < 5) ? ((m < 4) ? ((m < 3) ? ((m < 2)?
    printf("1/1") : printf("5/6")): printf("2/3")):printf("1/2")):printf("1/3")): printf("1/6");

    return 0;
}

#include<iostream>
#include<algorithm>
using namespace std;
int gcd(int a,int b)
{
    return b==0?a:gcd(b,a%b);
}
main()
{
    int a,b,x;
    while(cin>>a>>b)
    {
        x=6-max(a,b)+1;
        if(x==6)
        {
            cout<<"1/1"<<endl;
            continue;
        }
        cout<<x/gcd(x,6)<<"/"<<6/gcd(x,6)<<endl;
    }
}/*2018-01-11 23:42:37.735*/

#include<bits/stdc++.h>
using namespace std;
int a,b;
int d;
int check(int m,int n)
{
	int r;
	do{
		r=m%n;
		m=n;
		n=r;

	}
	while(r!=0);
	return m;
}
int main()
{
	cin>>a>>b;
	d=6-(max(a,b))+1;
	int ch=check(6,d);
//	cout<<ch<<" "<<d<<endl;
	if(max(a,b)==1) cout<<"1/1";
	else
	cout<<d/ch<<"/"<<6/ch;
}

#include<set>
#include<map>
#include<cmath>
#include<queue>
#include<limits>
#include <list>
#include <stack>
#include<vector>
#include<string>
#include<sstream>
#include<iostream>
#include<algorithm>
using namespace std;
# define MEM(arrdoone,w)   memset(arrdoone,w,sizeof arrdoone)
# define SET set<int>::iterator it = s.begin(); it != s.end();it++
# define ULL unsigned long long
# define eps 1e-9
# define LL  long long
# define IS istringstream
# define FOR(i,a,b) for(int i = a ; i < b ; i++)
# define FORI(i,a,b) for(int i = a ; i <= b ; i++)
# define MFOR(i,a,b) for(int i = a ; i > b ; i--)
# define MFORI(i,a,b) for(int i = a ; i >= b ; i--)
# define PII pair<int , int>
#define all(c) (c).begin(), (c).end()
# define pi 3.141592653589793238462
#define pb push_back
# define S size()
int main(){
int a[ 7 ];
   FOR(i , 0 , 6)
       a[ i ]=i+ 1;
   int n,m,k;
   cin >> n >> m;

   int slv =0 ;

   n=max(n,m);

 FOR(i ,0 , 6)
       if(a[ i ] >=n)
           slv++;

  k = 6;
   if(slv)
   if(6 % slv == 0 ){
        k = 6/slv;
         slv=1;

   }
   if(slv == 4){
          k = 3;
          slv = 2;

   }
   if(slv == 0)
       k = 1;
   cout <<slv<<"/"<<k<<endl;

}

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int NOD(int a, int b)
{
    while(a > 0 && b > 0)

        if(a > b)
            a %= b;

        else
            b %= a;

    return a + b;
}
int main()
{
	int x,y;
	cin>>x>>y;
	int k=max(x,y);
	int count=7-k;
	int g=NOD(count,6);
	cout<<count/g<<'/'<<6/g<<endl;
	return 0;
}

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

typedef long long ll;

int main(){
	int a, b; scanf("%d %d", &a, &b);
	a = max(a, b);
	b = 7 - a;
	a = __gcd(b, 6);
	cout << b / a << "/" << 6/a << endl;
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int a,b,c;
int gcd(int x,int y)
{
    if(y==0) return x;
    if(x%y==0) return y;
    return gcd(y,x%y);
}
int main()
{
    scanf("%d%d",&a,&b);
    c=max(a,b);
    printf("%d/%d",(6-c+1)/gcd(max(6-c+1,c-1),min(6-c+1,c-1)),6/gcd(max(6-c+1,c-1),min(6-c+1,c-1)));
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int a,b,c,d,p;
    cin>>a>>b;

        c=max(a,b);
        c=6-c+1;
        p=6;
        while(p)
        {
            if(c%p==0&&6%p==0)
            {
               cout<<c/p<<"/"<<6/p<<endl;
               return 0;
            }
            p--;

        }

    cout<<c<<"/"<<"6"<<endl;
    return 0;
}

#include<algorithm>
#include<bitset>
#include<math.h>
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<vector>
#include<sstream>

#define ll long long
#define vi vector<int>
using namespace std;
int gcd(int a,int b){
    return (b==0?a:gcd(b,a%b));
}
int main()
{
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);

int y,w,max,fact,num;

while(cin>>y>>w)
{

    if(y<w)
    max=w;
    else
    max=y;

    num=7-max;

    fact=gcd(num,6);

    cout<<num/fact<<"/"<<6/fact<<endl;

}

return 0;
}

#include<iostream>
#include<string>
#include<vector>
#include<map>
long gcd(long x, long y)
{
	int temp;
	if (y > x)
	{
		temp = x;
		x = y;
		y = temp;
	}
	while (y != 0)
	{
		temp = y;
		y = x % y;
		x = temp;
	}
	return x;
}
using namespace std;
int main()
{

	int a, b;
	int result;
	int gcdV;
	cin >> a >> b;
	result = a > b ? a : b;
	result = 6 - result + 1;
	gcdV = gcd(result, 6);
	cout << result / gcdV << "/" << 6 / gcdV;
	getchar();
	getchar();

	return 0;
}

#include <iostream>
#include <string>

using namespace std;

int main()
{
    int Y, W;
    cin >> Y >> W;

    const string probability[7] = {"", "1/1", "5/6", "2/3", "1/2", "1/3", "1/6"};
    int D = max(Y, W);
    cout << probability[D] << endl;
    return 0;
}

#include <iostream>
#include<cstdio>
using namespace std;
int main()
{
    int y,w,c,b;
    while(scanf("%d %d",&y,&w) != -1){
      b=6,c=0;
      if(y>w)
       {
        while(b>=y)
          {
             b--;
             c++;
          }
       }
      else
      {
          while(b>=w)
          {
              b--;
              c++;
          }
      }
      b=6;
      for(y=6;y>=2;)
      {
          if(b%y==0 && c%y==0)
              {
                  b=b/y;
                  c=c/y;
                  y=b;
                  continue;
              }
           y--;
      }
      cout<<c<<"/"<<b<<endl;
    }
    return 0;
}
//

//A
#include <stdio.h>
#define N 100011
#define min(a, b) ((a) < (b) ? (a) : (b))
#define max(a, b) ((a) > (b) ? (a) : (b))

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

int main(){
    int a, b;
    scanf("%d %d", &a, &b);
    int c = 7 - max(a, b);
    int d = gcd(6, c);
    printf("%d/%d\n", c/d, 6/d);
    return 0;
}

/*___________Bismillahir Rahmanir Rahim__________*/
//Think positive, be positive and never use negative words
#include<bits/stdc++.h>
#define RON              ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define ll               long long int
#define test             ll t;cin>>t;while(t--)
#define nl               endl
#define v_sum(a)         accumulate(a.begin(),a.end(),0)
#define v_max(a)         *max_element(a.begin(),a.end())
#define v_min(a)         *min_element(a.begin(),a.end())
#define v_sort(a)        sort(a.begin(),a.end())
#define v_gsort(a)       sort(a.begin(),a.end(),greater<int>())
#define v_uni(a)         a.erase(unique(a.begin(),a.end()),a.end())
#define ulta(a)          reverse(a.begin(),a.end())
#define yes              cout<<"YES"<<nl
#define no               cout<<"NO"<<nl
#define gcd(a,b)         __gcd(a,b)
#define lcm(a,b)         (a/gcd(a,b))*b
using namespace std;
int main()
{
    RON;
    ll a, b;
    cin>>a>>b;
    if(max(a,b)==1) cout<<"1/1"<<nl;
    else if(max(a,b)==2) cout<<"5/6"<<nl;
    else if(max(a,b)==3) cout<<"2/3"<<nl;
    else if(max(a,b)==4) cout<<"1/2"<<nl;
    else if(max(a,b)==5) cout<<"1/3"<<nl;
    else if(max(a,b)==6) cout<<"1/6"<<nl;
    else cout<<"0/1"<<nl;
    return 0;
}

/*_________________Alhamdulillah_________________*/

#include<bits/stdc++.h>
using namespace std;
int main(){
#ifndef ONLINE_JUDGE
    freopen("input.txt","r",stdin);
#endif
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int a,b;
    cin>>a>>b;
    int c=max(a,b);
    int x=__gcd(6-c+1,6);
    cout<<(6-c+1)/x<<"/"<<6/x<<endl;
    return 0;
}

#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;

int main()
{
		int x, y;
		cin >> x >> y;
		int up, down, common;
		up = 7 - max(x, y);
		down = 6;
		if (down % up == 0)
			common = up;
		else if (max(x,y) == 3)
			common = 2;
		else
			common = down / up;
		if (common - ceil(common) == 0)
			cout << up / common << "/" << down / common;
		else
			cout << up << "/" << down << endl;
}

#include <bits/stdc++.h>
using namespace std;
int main()
{
	int a,b,sum=0;
	cin>>a>>b;
	if(a<b) a=b;
	for(int i=1;i<=6;i++)
	   if(i>=a) sum++;
	if(sum==0) cout<<"0/1";
	if(sum==1) cout<<"1/6";
	if(sum==2) cout<<"1/3";
	if(sum==3) cout<<"1/2";
	if(sum==4) cout<<"2/3";
	if(sum==5) cout<<"5/6";
	if(sum==6) cout<<"1/1";
	return 0;
}

#include <iostream>

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

int main(){
    int a,b;
    cin>> a>>b;
    if (a>b) b=a;
    b=6-b+1;a=6;
    int d=gcd(a,b);
    a/=d;b/=d;
    cout<<b<<'/'<<a;
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
int s=max(n,m),ans=7-s;
if(ans==1)
cout<<"1/6";
else if(ans==2)
cout<<"1/3";
else if(ans==3)
cout<<"1/2";
else if(ans==4)
cout<<"2/3";
else if(ans==5)
cout<<"5/6";
else if(ans==6)
cout<<"1/1";
return 0;
}

#include <iostream>
#include <algorithm>

using namespace std;

int main(int argc, char const *argv[]){
	int a, b;
	cin >> a >> b;
	int max_temp = max(a, b);
	switch(max_temp) {
		case 1 : cout << "1/1" << endl;break;
		case 2 : cout << "5/6" << endl;break;
		case 3 : cout << "2/3" << endl;break;
		case 4 : cout << "1/2" << endl;break;
		case 5 : cout << "1/3" << endl;break;
		case 6 : cout << "1/6" << endl;break;
	}
	return 0;
}

#include<iostream>
#include<string>
#include<cmath>
using namespace std;
int main()
{
	string die[6]={"1/6","1/3","1/2","2/3","5/6","1/1"};
	int Y,K,D;
	cin>>Y>>K;
	D=max(Y,K);
	cout<<die[6-D];
	return 0;

}

#include<bits/stdc++.h>
using namespace std;
int gcd(int m,int n)
{
	if(n==0) return m;
	return gcd(n,m%n);
}
int y,w,d;
int main()
{
	scanf("%d%d",&y,&w);
	int maxn=max(y,w);
	int p1=7-maxn;
	int p2=6;
	int p3=gcd(p1,p2);
	printf("%d/%d",p1/p3,p2/p3);
	return 0;
}

#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>

using namespace std;

int a, b, c, d;

int main ()
{
    cin>>a>>b;
    if (a == b)
        c = a;
    else
        c = max(a,b);
    d = 6 - c + 1;
    c = 6;
    if (6 % d != 0 && d % 2 != 0)
        cout<<d<<"/"<<6;
    else
    {
        if (d % 2 == 0)
        {
            c /= 2;
            d /= 2;
        }
        if (c % d == 0)
        {
            c /= d;
            d = 1;
        }
        cout <<d<<"/"<<c;
    }
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int score,xY,xW,maxscore;
	cin>>xY>>xW;
	maxscore=max(xY,xW);
	score=6-maxscore+1;
	if(score==0)cout<<"0/1";
	else if(score==1)cout<<"1/6";
	else if(score==2)cout<<"1/3";
	else if(score==3)cout<<"1/2";
	else if(score==4)cout<<"2/3";
	else if(score==5)cout<<"5/6";
	else if(score==6)cout<<"1/1";
	return 0;
}

#include <iostream>
#include<cmath>
using namespace std;

int main()
{
    int y,w,m;
    cin>>w>>y;
    if(w > y)
    {
    m = y;
    y = w;
    w = m;
    }
    if(y==1)
        cout<<1<<"/"<<1;
    else if(y==2)
        cout<<5<<"/"<<6;
    else if(y==3)
        cout<<2<<"/"<<3;
    else if(y==4)
        cout<<1<<"/"<<2;
    else if(y==5)
        cout<<1<<"/"<<3;
    else if(y==6)
        cout<<1<<"/"<<6;
    return 0;
}

#include <iostream>

using namespace std;

int main(){
    int a,b;
    cin >> a >> b;
    int max=a;
    if (b>max){
        max=b;
    };
    int m = 6;
    int n=m-max+1;
    if (n==m){
        n=1;
        m=1;
    } else if (n % 2 == 0){
        m=3;
        n=n/2;
    } else if (n % 3 == 0){
        m = 2;
        n=n/3;
    } else if (n==6){
        m=1;
        n=1;
    };
    cout<<n<<"/"<<m;
    return 0;
}

#include<fstream>
#include<iostream>
#include<math.h>
#include<cstring>
#include<string>
#include<cmath>
#include<algorithm>
#include<math.h>
#include<cstdio>
#include<cctype>
#include<cmath>
#include<array>
#include<assert.h>

using namespace std;
int main()
{

    int num1 , num2 ;
    cin >> num1 >>num2 ;
    string Die_Roll[6]={ "1/6","1/3","1/2","2/3","5/6","1/1"} ;
    int x =0 ;
    x=max(num1,num2);
    cout << Die_Roll[6-x] <<endl;

return 0 ;
}

#include<algorithm>
#include<iostream>
#include<cmath>
using namespace std;
int a,b,c;
void print(int x,int y){
	int z=__gcd(x,y);
	cout<<x/z<<'/'<<y/z;
}
int main(){
	cin>>a>>b;
	c=max(a,b);
	print(7-c,6);
	return 0;
}

#include<iostream>
using namespace std;
int main()
{
    int a,b,i,w;
    cin>>a;
    cin>>b;
    i=7;
    if(a>b)
        w=7-a;
    else
        w=7-b;
    while(6)
    {
    i=i-1;
    if((w%i==0)&&(6%i==0))
    {
        w=w/i;
        cout<<w<<"/"<<6/i;
        return 0;
    }
    }

}

#include<bits/stdc++.h>
using namespace std;
template<typename T>inline void read(T &x){
	short f=1;x=0;char c=getchar();
	while(!isdigit(c)){ if(c=='-')f=-1;c=getchar(); }
	while(isdigit(c))x=(x<<3)+(x<<1)+(c^48),c=getchar();
	x*=f;
}
int main(){
    int a,b,k;
    read(a),read(b);
    switch(max(a,b)){
        case 1:cout<<"1/1"<<endl;break;
        case 2:cout<<"5/6"<<endl;break;
        case 3:cout<<"2/3"<<endl;break;
        case 4:cout<<"1/2"<<endl;break;
        case 5:cout<<"1/3"<<endl;break;
        case 6:cout<<"1/6"<<endl;break;
    }
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
int maxs=0,ans=0,y,w;
cin>>y>>w;
maxs=max(y,w);
ans=6-maxs;
if(ans+1==1)cout<<"1/6";
if(ans+1==2)cout<<"1/3";
if(ans+1==3)cout<<"1/2";
if(ans+1==4)cout<<"2/3";
if(ans+1==5)cout<<"5/6";
if(ans+1==6)cout<<"1/1";
return 0;
}

#include <iostream>
#include<bits/stdc++.h>
using namespace std;
int main()
{
  int yakko;
  int wakko;
  cin>>yakko;
  cin>>wakko;
  int countt=1;
  if(yakko==1&&wakko==1){cout<<1<<'/'<<1;return 0;}
  else
  {
      int x=max(yakko,wakko);
      countt+=6-x;
      for(int i=2;i<=5;i++)
      {
          if(countt%i==0&&6%i==0){cout<<countt/i<<'/'<<6/i<<endl;return 0;}
      }

      cout<<countt<<'/'<<6;
  }
    return 0;
}

#include<stdio.h>
int main()
{
    int x,y,flag;
    scanf("%d%d",&x,&y);
    if(x>=y)
    {
        flag=6-x+1;
        if(flag==1)
            printf("1/6\n");
        else if(flag==2)
            printf("1/3\n");
        else if(flag==3)
            printf("1/2\n");
        else if(flag==4)
            printf("2/3\n");
        else if(flag==5)
            printf("5/6\n");
        else
            printf("1/1\n");
    }
    else
    {
        flag=6-y+1;
        if(flag==1)
            printf("1/6\n");
        else if(flag==2)
            printf("1/3\n");
        else if(flag==3)
            printf("1/2\n");
        else if(flag==4)
            printf("2/3\n");
        else if(flag==5)
            printf("5/6\n");
        else
            printf("1/1\n");
    }
}//2020-10-12 19:35:55.122

# include <iostream>
# include <string>
# include <algorithm>
# include <vector>
# include <cstdio>
# include <cmath>
# include <math.h>
# include <iomanip>
# include <map>
# include <stack>
//#include<bits/stdc++.h>

using namespace std ;

int GCD ( int a,int b)
{
	for (int i=6;i>=1;i--)
	{
		if (a%i==0&&b%i==0)
			return i;
	}

}

int main ()
{

	int n,m,a,b,c;
	cin>>n>>m;
	if (m>n) swap(n,m);

		a=(6-(n-1));
		b=GCD (a,6);
		cout<<a/b<<"/"<<6/b<<endl;

	//system ("pause");

	return 0;

}

#include<cstdio>
using namespace std;
int a,b,max;
int main(){
	scanf("%d%d",&a,&b);

	if(a>b) max=a;
	else max=b;

	if(max==1) printf("1/1\n");
	else if(max==2) printf("5/6\n");
	else if(max==3) printf("2/3\n");
	else if(max==4) printf("1/2\n");
	else if(max==5) printf("1/3\n");
	else printf("1/6\n");
	return 0;
}//dhfd

#include<iostream>
#include <string>
#include<cctype>
#include <ctype.h>
#include<vector>
#include <algorithm>
#include<cmath>
using namespace std;
int main()
{
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	int a, b;
	cin >> a >> b;
	int mx = max(a, b);
	int n = (6 - mx) + 1;
	if (n == 6)
	{
		cout << 1 << '/' << 1 << endl;
		return 0;
	}
	if (n == 0)
	{
		cout << 0 << '/' << 1 << endl;
		return 0;
	}
	int o = 6;
	if (n % 2 == 0)
	{
		cout << n/2 << '/' << 6/2 << endl;
		return 0;
	}
	if (n % 3 == 0)
	{
		cout << n / 3 << '/' << 6 / 3 << endl;
		return 0;
	}
	cout << n  << '/' << 6 << endl;
}

#include <bits/stdc++.h>

using namespace std;

int main() {
  int a, b, c = 6;
  cin >> a >> b;
  a = b = a > b ? 6 - --a : 6 - --b;
  while (a > c ? a %= c : c %= a);
  a += c;
  cout << b / a << '/' << 6 / a;
}

#include <iostream>
using namespace std;
int main() {
	int y, w, counter = 0, max, demo = 6, arr[6] = {1,2,3,4,5,6};

	cin >> y >> w;
	if (w > y) {
		max = w;
	}
	else if (y > w) {
		max = y;
	}
	else if (w == y) {
		max = y;
	}
	if (max == 1) {
		cout << "1/1" << endl;
	}
	else {
		for (int i = 0; i < 6; i++) {
			if (arr[i] >= max) {
				counter++;
			}
		}

		if (counter == 0) {
			cout << counter << "/1" << endl;
		}
		else {
			if (demo%counter == 0) {
				demo /= counter;
				counter /= counter;
			}
			else if (demo % 2 == 0 && counter % 2 == 0) {
				demo /= 2;
				counter /= 2;
			}
			cout << counter << "/" << demo << endl;
		}
	}
	return 0;
}

#include <iostream>
#include <string>

using namespace std;

int maximum(int a, int b) {
	if (a > b) {
		return a;
	}
	else {
		return b;
	}
}

int main() {

	int y, w;
	cin >> y >> w;

	int max_num = maximum(y, w);

	string probabilities[6] = {"1/6","1/3","1/2","2/3","5/6","1/1"};

	cout << probabilities[6 -max_num] << endl;

}

#include <bits/stdc++.h>
using namespace std;
int a,b,c,d,e;
int main(){
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
cin>>a>>b;
a=max(a,b);
b=6-a+1;
if(b==1) cout<<"1/6";
if(b==2) cout<<"1/3";
if(b==3) cout<<"1/2";
if(b==4) cout<<"2/3";
if(b==5) cout<<"5/6";
if(b==6) cout<<"1/1";
return 0;
}

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<algorithm>
using namespace std;
int main()
{
	int n,m;
	scanf("%d%d",&n,&m);
	int s=7-max(n,m);
	if(s==1)printf("1/6");
	else if(s==2)printf("1/3");
	else if(s==3)printf("1/2");
	else if(s==4)printf("2/3");
	else if(s==5)printf("5/6");
	else if(s==6)printf("1/1");
	return 0;
}

#include <iostream>
#include <algorithm>
using namespace std;

int main(){

	int n1,n2;
	cin >> n1 >> n2;
	int n;
	if(n1 > n2)
		n = 6 - n1 + 1;
	else
		n = 6 - n2 + 1;
	int gcd = __gcd(n,6);
	cout << n/gcd << "/" << 6/gcd;
	return 0;
}

#include <iostream>
#include <vector>
#include <string>
#include <array>
#include <stdio.h>
#include <algorithm>
#include <deque>
#include <cmath>

using namespace std;

int main() {
    int m, n;
    cin >> n >> m;
    int a;
    int b = 6;
   if(n>m){
       a = n;
   }else{
     a = m;
   }
   int max = a;
   a = 6 - a+1;
    while (a % b != 0 && b%a!=0) {
        if (a >= b) {
            a = a % b;
        } else {
            b = b % a;
        }
    }
    int nod = 1;
    if (b <= a) {
        nod = b;
    } else {
        nod = a;
    }
   cout<<(6-max+1)/nod<<'/'<<6/nod;
}

#include<iostream>
#include<string>
using namespace std;
string s[7]={"1/6","1/3","1/2","2/3","5/6","1/1"};
int a,b;
int main()
{
	cin>>a>>b;
	cout<<s[6-max(a,b)];
	return 0;
}

#include <iostream>

using namespace std;

int main() {

    int n, m;

    cin >> n >> m;

    n = max(n, m);

    if (n == 1) cout << "1/1" << endl;

    if (n == 2) cout << "5/6" << endl;

    if (n == 3) cout << "2/3" << endl;

    if (n == 4) cout << "1/2" << endl;

    if (n == 5) cout << "1/3" << endl;

    if (n == 6) cout << "1/6" << endl;

    return 0;

}

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int a,b;
	cin>>a>>b;
	if(a<b)
	{
		swap(a,b);
	}
	if(a==1)
	{
		cout<<"1/1";
	}
	else if(a==2)
	{
		cout<<"5/6";
	}
	else if(a==3)
	{
		cout<<"2/3";
	}
	else if(a==4)
	{
		cout<<"1/2";
	}
	else if(a==5)
	{
		cout<<"1/3";
	}
	else
	{
		cout<<"1/6";
	}
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int gcd(int x,int y){
    for(int i=x;i>=1;i--){
        if(x%i==0&&y%i==0)
            return i;
}
}
int main(){
    int y,w;
    cin>>y>>w;
    cout<<(6-max(y,w)+1)/gcd((6-max(y,w)+1),6)<<'/'<<6/gcd((6-max(y,w)+1),6);
}

// luogu-judger-enable-o2
#include<bits/stdc++.h>
using namespace std;
int main(){
    int a,b,c;
    cin>>a>>b;
	c=max(a,b);
	if(c==1)
	cout<<"1/1";
	else if(c==2)
	cout<<"5/6";
	else if(c==3)
	cout<<"2/3";
	else if(c==4)
	cout<<"1/2";
	else if(c==5)
	cout<<"1/3";
	else
	cout<<"1/6";
	return 0;
    return 0;
}

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

int main()
{

    ios::sync_with_stdio(0);
	cin.tie(0);
	int y,w;
	cin>>y>>w;
	int ans;
	ans = 2;
	if (y==w){
		ans = 0;
	}
	else if (y>w){
		ans = 6 - y + 1;
	}
	else if (w>y){
		ans = 6 - w + 1;
	}
	if (ans == 0){
		cout<<1<<'/'<<ans<<endl;
	}
	if (ans == 1){
		cout<<1<<'/'<<6<<endl;
	}
	if (ans == 2){
		cout<<1<<'/'<<3<<endl;
	}
	if (ans == 3){
		cout<<1<<'/'<<2<<endl;
	}
	if (ans == 4){
		cout<<2<<'/'<<3<<endl;
	}
	if (ans == 5){
		cout<<5<<'/'<<6<<endl;
	}

	return 0;
}

#include<iostream>

using namespace std;
int main ()
{ int w,y,k;
    k=0;
    cin>>w>>y;

       { if(w>=y)
           k=7-w;
        else
           k=7-y;}
      { if (k==2)
    cout<<1<<"/"<<3;

    else if (k==3)
    cout<<1<<"/"<<2;
        else if(k==0)
        cout<<1<<"/"<<1;
        else
        cout<<k<<"/"<<6;

    }

return 0;
}

#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <vector>
using namespace std;
int main()
{
	int i, j, k, m, n, a[10000], l, c, d, nl, np, r;
	char s[20000];
	pair <int, int > p[100000];
	bool t = false;
	double x, y;
	cin >> n >> k;
	m = 6 - max(n, k) + 1;
	cout << m << "/6" << endl;
//	system("pause");
	return 0;
}

#include<iostream>
#include<string>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
using namespace std;
int main(){
	std::ios_base::sync_with_stdio(0);
	cin.tie(NULL);
	cout.tie(NULL);
	int n, k;
	cin >> n >> k;
	int a = min(n, k);
	int b = max(n, k);
	 int c=b/a;
	if (c == 0)
		cout << 0 << "/" << 1;
	else if (c==1)
		cout << 1 << "/" << 1;
	else
		cout << 1 << "/" << c;

	return 0;
}

#include <bits/stdc++.h>

using namespace std;

int main(){
    int n,m,cont=0; cin>> n >> m;
    for(int i=1;i<=6;++i){
        if(i>n && i>m)cont++;
    }
    if(cont==0)cout<<"0/1"<<endl;
    else cout<<1<<"/"<<cont<<endl;

    return 0;
}

#include<bits/stdc++.h>

using namespace std ;

int main(){

    int  a , b , x  ;

    cin>>a>>b ;
    int mx = max(a , b ) ;
    x = 6-mx +1 ;

    if(mx==1)cout<<"1/1\n";
    else if(mx==6)cout<<"0/1\n";
    else {
        int y = 6 ;
        if(y%x==0){
            y/=x ; x = 1 ;
        }
        else if(x==4){
            x = 2  ; y = 4 ;
        }
        cout<<x<<"/"<<y<<"\n" ;
    }

    return 0 ;
}

#include "iostream"
using namespace std;

int main()
{
	int y, w, max;
	cin >> y >> w;
	if (y >= w) max = y;
	else max = w;
	max = 6 - max+1;
	if (max == 2) cout << "1/3";
	else if (max == 3) cout << "1/2";
	else cout << max << "/6";
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int64_t a,b;
    cin>>a>>b;
    cout<<b/2<<"/"<<a/2<<endl;
    return 0;
}

#include<iostream>
#include<algorithm>
using namespace std;

#define f(number) for(int i = 0 ; i<number ; i++)
int main()
{
	int a[7]={0,6,5,4,3,2,1};
	int x,y;
	cin>>x>>y;
	if(max(x,y) == 1)
		cout<<"6/6"<<endl;
	if(max(x,y) == 2)
		cout<<"5/6"<<endl;
	if(max(x,y) == 3)
		cout<<"2/3"<<endl;
	if(max(x,y) == 4)
		cout<<"1/2"<<endl;
	if(max(x,y) == 5)
		cout<<"1/4"<<endl;
	if(max(x,y) == 6)
		cout<<"1/1"<<endl;

	//system("pause");
	return 0;
}

#include <iostream>
#include <string>
#include <algorithm>
using namespace std;

void solve(int a, int b) {
    if (a <= b) { cout << "1/1" << endl; return; }
    if (a > b+6) { cout << "0/1" << endl; return; }
    int A = 6 - a + 1;
    a = 6; b = A;
    for (int i = 2; i <= 6; ++i) {
        while (a%i == 0 && b%i ==0) {
            a /= i;
            b /= i;
        }
    }
    cout << b << "/" << a << endl;
}

int main() {
    int a, b;
    cin >> a >> b;
    solve(a,b);
    return 0;
}

#include<iostream>
#include<map>
#include<utility>
#include<string>
#include<cstring>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<set>
#include<map>
#include<sstream>
#include<queue>

using namespace std;

typedef vector<int> vi ;
typedef pair<int , int > ii ;
int gcd(int a, int b) { return (b == 0 ? a : gcd(b, a % b)); }

int main ()
{
	int w , y , a , b , g ;

	cin>>w>>y ;

	a = 6-max(w,y)+1;
	b=6;
	g = gcd(a,b);
	if(a==0)
		cout<<"0/1";
	else
		if(a==1)
			cout<<"1/1";
	else
	{
		a /= g ;
		b /= g ;
		cout<<a<<"/"<<b;
	}

	return 0 ;
}

#include<iostream>
using namespace std;
int v=1;
void t(int &n,int &b){
    while(v<b){
    if(n%v==0&&b%v==0)
    {
    n=n/v;
    b=b/v;
    }
    v++;
    }}

void main(){
    int m,b;
    cin>>m>>b;
    if(m==0)
        cout<<0<<'/'<<b<<endl;
    else if(m%b==0)
        cout<<1<<'/'<<m/b<<endl;
    else
        {t(m,b);
        cout<<b<<'/'<<m<<endl;
    }}

#include<iostream>
using namespace std;
int main()
{
  int a,b,win;
  cin>>a>>b;
  if(a<b) win=(b-6)+1;
  else win =(a-6)+1;

 if(a<b) {
     if(b%a==0)
      cout<<a/a<<"/"<<b/a;
     else
     cout<<a<<"/"<<b;
 }
 else {
     if(a%b==0)
         cout<<b/b<<"/"<<a/b;
     else
         cout<<b<<"/"<<a;
 }
    return 0;
}

#include<vector>
#include<stack>
#include<queue>
#include <deque>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <math.h>
#include<string>
#include <map>
using namespace std;

int main()
{

    int w, y,d;
    cin >> w >> y;

    int m = max(w, y);
    d = 6 - m + 1;
    if (d == 6) {
        cout <<1<<"/"<<1;
    }
    else if (d == 4) {
        cout << 2 << "/" << 3;
    }
    else if (d == 3) {
        cout << 1 << "/" << 2;
    }
    else {
        cout << d<<"/"<<6;
    }

    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{ int b,c;
cin>>b>>c;
b=6-max(b,c)+1;

if(b==6) cout<<"0/1";
else if(b==2) cout<<"1/3";
else if(b==3) cout<<"1/2";
else if(b==4) cout<<"2/3";
else if(b==1) cout<<"1/1";
else cout<<b<<"/6";
}

#include <iostream >
#include <cmath>
#include <string>
#include <bits/stdc++.h>
#include <algorithm>
using namespace std;

int main() {
  int y , w ;
  cin >> y >> w ;
  int max = 0 ;
  if (max <= y ) max = y ;
  if (max <= w ) max = w ;
  int a = 6-max+1 ;
  if ( a == 0 ) cout << "0/1 " ;
  else if ( a== 1 ) cout << "1/1" ;
  else {
	  int k = 6 ;
     while( a % 2 == 0 ) {
	       a /= 2 ;
	       k /= 2 ;
	  }
	  while ( a% 3 == 0 ) {
		  a /= 3 ;
		  k /= 3 ;
  }
    cout << a <<"/" << k ;
}
   return 0 ;
}

#include <iostream>

using namespace std;

int main()
{
    int n,m;
    cin>>n>>m;
    int x=1;
    int maxi=0;
    if((6-n)>maxi)
    {
       maxi=6-n;
    }
    if((6-m)>=maxi)
    {
        maxi=6-m;
    }
    if(maxi==6)
    {
        cout<<1<<'/'<<1;
    }
    else if(maxi==5)
    {
        cout<<1<<'/'<<3;
    }
    else if(maxi==4)
    {
        cout<<1<<'/'<<2;
    }
    else if(maxi==3)
    {
        cout<<2<<'/'<<3;
    }
    else if(maxi==2)
    {
        cout<<5<<'/'<<6;
    }
    else if(maxi==1)
    {
        cout<<1<<'/'<<1;
    }
    return 0;
}

#include <math.h>;
#include <string>;
#include <iostream>;
#include <string>
#include <vector>

int Max(int a, int b) {
	if (a > b) {
		return a;
	}
	else {
		return b;
	}
}
int Min(int a, int b) {
	if (a < b) {
		return a;
	}
	else {
		return b;
	}
}

std::string GetFr(int a, int b) {
	if (a == 0 || b == 0) {
		return "0/1";
	}

	int div = Min(a, b);
	while (true) {
		if (a % div == 0 && b % div == 0) {
			a /= div;
			b /= div;
			if (div == 1) {
				break;
			}
			div = Min(a, b);
		}
		else {
			div--;
		}
	}
	return std::to_string(a) + '/' + std::to_string(b);
}

int main() {
	int Y, W;
	std::cin >> Y >> W;
	int m = Max(Y, W);

	std::cout << GetFr(6-m, 6);
}

#include <bits/stdc++.h>

using namespace std;

int i, w, mx, a;

int main () {
	cin >>i>>w;
	mx=max (i, w);
	if (mx==i){
		a++;
	}
	cout <<a<<"/"<<6-mx;
	return 0;
}

#include<bits/stdc++.h>

using namespace std;

int main()
{
    int a,b;

    cin>>a>>b;

    if((a/b)>0){
        cout<<"1/"<<(a/b)<<endl;
    }
    else{
        cout<<"0/1"<<endl;
    }
    return 0;
}

#include <iostream>
#include <string>
#include <stdio.h>
using namespace std;

int main(){
int y,w,p;
cin>>y>>w;
if(y>=w)
    {
p=6-y+1;
}
else
{
    p=6-w+1;
}
cout<<y<<" "<<w<<" "<<p<<endl;
switch(p){
        case 0:
    cout<<"0/1"<<endl;
    break;
    case 1:
    cout<<"1/6"<<endl;
    break;
        case 2:
    cout<<"1/3"<<endl;
    break;
        case 3:
    cout<<"1/2"<<endl;
    break;
        case 4:
    cout<<"2/3"<<endl;
    break;
        case 5:
    cout<<"5/6"<<endl;
    break;
        case 6:
    cout<<"1/1"<<endl;
    break;
}
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int a,b,c;
    cin>>a>>b;
    c=max(a,b);
    c=(6-c)+1;
    if(c%2==1)
    {
        if(c==3)
            printf("1/2\n");
        else
            printf("%d/6\n",c);
    }
    else
    {
        if(c==4)
            printf("2/3\n");
        else if(c==2)
        cout<<"1/3"<<endl;
        else
           printf("1\n");
    }
}

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

int main()
{
    int z,a,b,m;
    double x=0.0;
    cin>>a>>b;
    m=max(a,b);
    z=(6-m)+1;
    x=z/6.0;
    switch(z){
        case 1: cout<<"1/6";
            break;
        case 2: cout<<"2/6";
            break;
        case 3: cout<<"1/2";
            break;
        case 4: cout<<"2/3";
            break;
        case 5: cout<<"5/6";
            break;
        case 6: cout<<"1/1";
            break;
    }
}

#include<cstdio>
#include<cmath>
using namespace std;
int max(int a, int b)
{
	if (a > b)
		return a;
	else
		return b;
}
int main()
{
	int x, y;
	scanf("%d%d", &x, &y);
	int c = 7 - max(x, y);
	int d = 6;
	if (d % c == 0)
		if (c % 6 == 0)
		{
			c = 1;
			d = 1;
		}
		else
		if (c % 3 == 0)
		{
			c /= 3;
			d /= 3;
		}
		else
		if (c % 2 == 0)
		{
			c /= 2;
			d /= 2;
		}
	printf("%d/%d\n", c, d);
}

#include <iostream>
#include<cmath>
using namespace std;
int main ()
{
  float n,y ;
  cin>>n>>y;
  if (n==1&&y==1)
	  cout<<"1/1";
  else if (n<=2&&y<=2)
	  cout<<"5/6";
  else if (n<=3&&y<=3)
	  cout<<"2/3";
  else  if(n<=4&&y<=4)
	  cout<<"1/2";
  else if(n<=5&&y<=5)
	  cout<<"1/3";
  else
	  cout<<"0";

	cin>>n;
	return 0;
}

#include <iostream>
#include <string>

using namespace std;

int main()
{
 	int y,w,k;
 	int A,B,r,x;
 	cin>>y>>w;
 	k=max(y,w);
 	A=6-k+1;
 	x=A;
 	B=6;
	cout<<A<<endl;
	cout<<B<<endl;
	 while(B != 0)
    {
      r = A%B;
      A = B;
      B = r;
    }
	if (A==1){
		cout<<x<<"/6"<<endl;
	}
	else {
		if (A==2){
			if(x==4){
				cout<<"2/3";
			}
			if (x==2){
				cout<<"1/3";
			}
		}

		else{
			if (A==3){
				cout<<"1/2";
			}
		}
	}
	return 0;
}

#include <iostream>
using namespace std;

 int main(){
 int i;
 int b;
 int c;
 int g;
 cin>>i>>b;
 g=i/2;
 c=b/2;
 cout<<c;cout<<"/";cout<<g;

 }

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

void kick()
{
    int n,m;
    cin>>n>>m;

    if(n==1 || m==1) cout<<"1"<<endl;
    else cout<<"1/2"<<endl;
}
int main()
{
    kick();
}

/*
**************
*   Good     *
*  Luck!!!   *
*            *
**************
*/
#include<iostream>
#include<stdio.h>
#include<set>
#include<map>
#include<stdlib.h>
#include<ctime>
#include<memory.h>
#include<vector>
#include<math.h>
#include<deque>
#include<stack>
#include<list>
#include<queue>
#include<algorithm>
#include<string>
#include<string.h>
#include<cmath>
#include<fstream>
#include<iomanip>
//#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define db double
#define file "file"
#define int long long
//#define M_PI 3.1415926535897931
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef map<int, int> mpi;
typedef set<int, int> sti;

const int maxN = 1e5;
const int INF = 1e9;
const int eps = 1e-9;
const int inf = -INF;
const int base = 1000 * 1000 * 1000;
const int mod = 1e9 + 7;
typedef ll mass[maxN + 1];

int readInt ()
{
    bool minus = false;
    int result = 0;
    char ch;
    ch = getchar();
    while (true)
    {
        if (ch == '-') break;
        if (ch >= '0' && ch <= '9') break;
        ch = getchar();
    }
    if (ch == '-') minus = true;
    else result = ch-'0';
    while (true)
    {
        ch = getchar();
        if (ch < '0' || ch > '9') break;
        result = result*10 + (ch - '0');
    }
    if (minus)
        return -result;
    else
        return result;
}
struct pt
{
    int x, y;
};
bool comp(pt a, pt b)
{
    return a.x < b.x || (a.x == b.x && a.y < b.y);
}
ll gcd(ll a, ll b)
{
    return b ? gcd(b, a % b) : a;
}
ll lcm(ll a, ll b)
{
    return a / gcd(a, b) * b;
}
ll binary_power(ll a, ll n)
{
    ll res = 1;
    while(n > 0)
    {
        if(n % 2 == 0)
        {
            a *= a;
            n >>= 1;
        }
        else
        {
            res *= a;
            n--;
        }
    }
    return res;
}
int bitCount(ll n)
{
    return __builtin_popcount(n);
}
int LowerBound(int L, int R, int x, ll w[])
{
    // L = 0, R = n
    while(R - L > 1)
    {
        int mid = (L + R) >> 1;
        if(w[mid] >= x)
            R = mid;
        else
            L = mid;
    }
    if(w[R] == x)
        return R;
    return -1;
}
int UpperBound(int L, int R, int x, ll w[])
{
    // L = 1, R = n + 1
    while(R - L > 1)
    {
        int mid = (L + R) >> 1;
        if(w[mid] <= x)
            L = mid;
        else
            R = mid;
    }
    if(w[L] == x)
        return L;
    return -1;
}
db dis(db x1, db y1, db x2, db y2);
double triangle_area (int x1, int y1, int x2, int y2, int x3, int y3) ;
int triangle_area_2 (int x1, int y1, int x2, int y2, int x3, int y3) ;
ll n,m;
main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    //freopen(file".in", "rt", stdin);
    //freopen(file".out", "wt", stdout);
    cin >> n >> m;
    ll col = 4;
    ll nod = 6 - max(n,m);
    cout << nod / gcd(col,nod) << "/" << col / gcd(col,nod);
    return 0;
}
db dis(db x1, db y1, db x2, db y2)
{
    return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
int triangle_area_2 (int x1, int y1, int x2, int y2, int x3, int y3) {
        return (x2 - x1) * (y3 - y1) - (y2 - y1) * (x3 - x1);
}
double triangle_area (int x1, int y1, int x2, int y2, int x3, int y3) {
        return abs (triangle_area_2 (x1, y1, x2, y2, x3, y3)) / 2.0;
}
//

#include <iostream>
#include <cmath>
using namespace std;

int main()
{
    int y, w;
    string roll[6]={"1/6","5/6","1/2","1/3","5/6","1/1"};
    cin>>y>>w;
    w=max(w,y);
    cout<<roll[6-w]<<endl;

    return 0;
}

#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <string>
#include <time.h>
#include <stdlib.h>
#include <random>
#include <stack>
#include <sstream>

using namespace std;

#define ll long long
#define pii pair<int,int>
#define mp make_pair
#define endl "\n"
#define pdd pair<double, double>
#define pll pair<ll, ll>
#define PI 3.14159265358979

int main()
{
	ios_base::sync_with_stdio(0);

	int x, y;
	cin >> x >> y;

	int mx = max(x, y);
	int d = 6 - mx;
	for (int i = 2; i <= 6; ++i)
		if (d % i == 0 && mx % i == 0)
		{
			d /= i;
			mx /= i;
		}

	cout << min(d,mx) << "/" << mx;

	return 0;
}

#include <iostream>
using namespace std;

int main()
{
	int a,g=1,b,c=0;
	cin>>a>>b;
	if (a>b)
	{

			c=6-a;
		}
		else
		{
			c=6-b;
		}

		c+=1;
		if (c==5)
		{
			c=5;
			g=6;
		}
		else if (c==3){
		c=1;
		g=2;}
		else if(c==4)
		{c=2;
		g=3;

		}
		else if(c==2)
		{
			c=1;
			g=3;
		}
		cout<<c<<"/"<<g;

}

#include<iostream>
#include<cstdlib>
using namespace std;
main()
{
     int y,w,i,j,count=0,ar[20];
     float s;
     cin>>y>>w;
     int g=0;
     ar[0]=y;
     ar[1]=w;
     for(i=0;i<2;i++)
     {
          if(g<ar[i])
          g=ar[i];
     }
     for(i=g;i<=6;i++)
     {
       count++;
     }
     int n1,n2,o=0,m=0,arr[100],arr1[100];
     n1=count;
     n2=6;

     for(j=2;j<=n1/2;j++)
     {
          if(n1%j==0)
          {
          arr[m]=j;
          m++;
          }
     }
     for(j=2;j<=n1/2;j++)
     {
          if(n2%j==0)
          {
          arr1[o]=j;
          o++;
          }
     }

     return 0;
}

#include<bits/stdc++.h>

using namespace std;
int Y, W;
main()
    {
    cin >> Y >> W;
    cout << max(Y, W)  - 1<< "/" << 6;
    }

#include <iostream>
#include <algorithm>
#include  <string>
using namespace std;

int main()
{

    int p,p1,m1,y,w,maxx;
    cin>>y>>w;
    if(y>w){
        maxx=y;
    }
    else if(w>y){
        maxx=w;
    }
    p=maxx;

    if(p==2){
        p1=1;
        m1=6;
    }

    if(p==1){
        p1=1;
        m1=1;
    }
    if(p==3){
        p1=1;
        m1=3;
    }
    if(p==4){
        p1=1;
        m1=2;
    }

    if(p==5){
        p1=2;
        m1=3;
    }
    if(p==6){
        p1=1;
        m1=1;
    }
    cout<<p1<<"/"<<m1<<endl;
}

#include <iostream>
#include <string>
#include <algorithm>
#include <math.h>

using namespace std;

int main()

{
    int n , m ;
    cin>>n>>m ;
    int d =6-max(n,m)+1;
    cout<<max(n,m)<<endl;
    cout<<d<<endl;
    if(6%d==0)cout<<d/d<<"/"<<6/d;
    else cout<<d<<"/"<<6;

    return 0;
}

#include <bits/stdc++.h>

using namespace std;
long long l,f[111111],res;
double c;
long long n,m,mn=-999999;
int main(){

//freopen("floyd.in","r",stdin);
//freopen("floyd.out","w",stdout);

ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n>>m;
if(n==1 && m==1){
cout<<"1/1";
}
if(n==6 && m==6){
cout<<"0/1";
}
if(n==1 && m==2 || n==2 && m==1){
cout<<"5/6";
}
if(n==4 && m==2 || n==2 && m==4) cout<<"1/2";

return 0;
}

	#include <iostream>
	#include <string>
	using namespace std;

	int max(int a, int b)
	{
		int max = 0;
		if(a>b)
		{
			max = a;
		}
		else
			max = b;
		return max;
	}

	int main ()
	{
		int Y, W;
		int answert;
		int answerb;

		cin >> Y >> W;
		int maxa = max(Y, W);
			answert = maxa-1;
			if(answert==0)
			{
				answert = 1;
				answerb=1;
				}
			if(6%answert==0)
			{
				answerb=6/answert;
				answert=1;
			}
			else if(answert==4)
			{
				answert=2;
				answerb=3;
			}
			else
				answerb = 6;
		cout <<answert<<"/"<<answerb;
	}

#include <iostream>

using namespace std;

int main()
{
    int y,w,n;

    cin>>y;
    cin>>w;
    if(y>w)
    {
        n=(6-y)+1;
    } else
    {
        n=(6-w)+1;
    }
    if(n%2==0)
    {
        n=n/2;
        cout<<n<<"/3"<<endl;
    }else if(n%3==0)
    {
        n=n/3;
        cout<<n<<"/2"<<endl;
    }
    else cout<<n<<"/6"<<endl;

}

#include <iostream>
#include <map>
#include <string>
#include <algorithm>
#include <deque>
#include <queue>
using namespace std;

int main()
{
	int y, w;
	cin >> y >> w;
	if (max(y, w) == 1)
		cout << "1/1";
	else if (max(y, w) == 2)
		cout << "1/5";
	else if (max(y, w) == 3)
		cout << "2/3";
	else if (max(y, w) == 4)
		cout << "1/2";
	else if (max(y, w) == 5)
		cout << "1/3";
	else if (max(y, w) == 6)
		cout << "1/6";

}

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int a,b;
	cin>>a>>b;
	int x=max(a,b);
	if(x==1)
	cout<<1/1;
	if(x==2)
	cout<<5/6;
	if(x==3)
	cout<<2/3;
	if(x==4)
	cout<<1/2;
	if(x==5)
	cout<<1/3;
	if(x==6)
	cout<<1/6;
	return 0;
}

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

int main()
{
int s[2],x=0;
cin >>s[0]>>s[1];
int z=*max_element(s,s+2);
for (int i=z; i<=6; i++) {

    if (i>=z) x++;

}
if (x==1)   cout <<1<<"/"<<6;
if (x==0)   cout <<0<<"/"<<1;
 if (6%x==0)   cout <<x/x<<"/"<<6/x;
 else cout <<x<<"/"<<6;

    return 0;

}

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

using namespace std;

int main() {
    double y,w;
    cin >> y >> w;
    double mx = max(y,w);

    double tmp = (6-mx+1)/6;

    if(tmp == 0.16)cout << "1/6";else
        if(tmp == 0.33)cout << "1/3"; else
            if(tmp == 0.5) cout << "1/2"; else
                if(tmp == 0.66)cout << "2/3";else
                    if(tmp > 0.7 && tmp < 0.85)cout << "5/6";
                        else if(tmp == 1)cout << "1/1";
}

#include<bits/stdc++.h>
using namespace std;
int main(){
	int a,b,t;
	cin>>a>>b;
	t=max(a,b);
	if(t==1)cout<<"1\1\n";
	if(t==2)cout<<"5/6\n";
	if(t==3)cout<<"2/3\n";
	if(t==4)cout<<"1/2\n";
	if(t==5)cout<<"1/3\n";
	if(t==6)cout<<"1/6\n";
	return 0;
}

#include <bits/stdc++.h>
using namespace std;
int cnt;
int gcd(int a,int b)
{
    if(a<b)
    {
        swap(a,b);
    }
    if(b==0)
    {
        return a;
    }
    else
    {
        return gcd(b,a%b);
    }
}
int main()
{
    int a,b;
    cin>>a>>b;
    int m=max(a,b);
    int t=6,l=6;
    while(t>=m)
    {
        t--;
        cnt++;
    }
    t=gcd(cnt,6);
    l=l/(6/t);
    cout<<t<<"/"<<l<<endl;
}

#include <iostream>
#include <cmath>

using namespace std;

int main()
{

    int x,y;
    string a[6]={"1/6","1/3","1/2","4/6","5/6","6/6"};
    cin>>x>>y;

    int ans=max(x,y);

    cout<<a[6-ans]<<endl;

    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main(){
    int a,b;
    cin>>a>>b;

    int c=6-max(a,b)+1;
    if(c==6){
        cout<<"1/6";
        return 0;
    }
    if(c==1) {cout<<"1/1";
    return 0;}
    if(c%2==0) {cout<<c/2<<"/"<<3;
    return 0;}
    if(c%3==0){
        cout<<"1/2";
        return 0;
    }
cout<<c<<"/6";

return 0;
}

#include<iostream>
#include<string>
using namespace std;
void main()
{
	int w,y,max,p,c,a,b,m=2;
	double d;
	cin >> w>>y;
	if(w>=y)
	{
	 max=w;
	}
	else if(y>=w)
	{
	 max=y;
	}
	p=(6-max)+1;
	while(m<=6)
	{
	  if (p%m==0&&6%m==0)
	  {
	    a=p/m;
		b=6/m;
		break;
	  }
	  else
	{
	 a=p;
	 b=6;
	}
	  m++;
	}
	cout <<a<<"/"<<b;
}

#include<cstdio>
#include<iostream>
#include<unordered_map>
#include<vector>
using namespace std;

int gcd(int a, int b)
{
    if(a == 0)
    {
        return b;
    }
    else if(b == 0)
    {
        return a;
    }

    int q = a/b;
    int r = a%b;

    return gcd(q, r);

}

int main()
{
    int y, w;
    scanf("%d%d", &y, &w);
    int m = max(y, w);
    int l = 6 - m + 1;
    int g = gcd(l, 6);
    int a = l/g;
    int b = 6/g;

    cout << a << "/" << b;
    return 0;
}

#include <iostream>
#include <stack>
#include <queue>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
using namespace std;
int main ()
{
    int n,m,output=0,y=0;
    cin>>n>>m;
    if (n>m)
    {
        output=6-n+1;
    }
    else
    {
        output=6-m+1;
    }
    if (output==6)
    {cout<<'1'<<endl;
    }
    else if (output%2==0)
    {
        output=output/2;
        y=3;
    }
    else if (output%3==0)
    {
        output=output/3;
        y=2;
    }
    cout<<output<<'/'<<y<<endl;
    return 0;
}

#include<iostream>
#include<string>
using namespace std;
void main()
{

	int arr[2],x;
	for (int i = 0; i < 2; i++)
		cin >> arr[i];
	if (arr[0] == arr[1])
		cout << "1/1 \n";
	else if (arr[0]>arr[1])
	{
		x = 6 - arr[0]+1;
		switch (x)
		{
		case 4:
			cout << "2/3 \n";
			break;
		case 3:
			cout << "1/2 \n";
			break;
		case 2:
			cout << "1/3 \n";
			break;
		case 1:
			cout << "1/6 \n";
			break;
		default:
			cout << " 0/1 \n";

		}
	}
	else
	{
		x = 6 - arr[1]+1;
		switch (x)
		{
		case 4:
			cout << "2/3 \n";
			break;
		case 3:
			cout << "1/2 \n";
			break;
		case 2:
			cout << "1/3 \n";
			break;
		case 1:
			cout << "1/6 \n";
			break;
		default:
			cout << "0/1 \n";

		}
	}
}

#include<iostream>
#include<cstdio>
using namespace std;
int maxn,a,b;
int main(){
	cin>>a>>b;
	maxn=max(a,b);
	maxn=6-maxn+1;
	if(maxn==0) cout<<"0/1";
	else if(maxn==6) cout<<"1/1";
	else if(maxn%2==0) cout<<maxn/2<<"/3";
	else if(maxn%3==0) cout<<maxn/3<<"/2";
	return 0;
}

#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
	int a,b;
	cin>>a>>b;
	int ans = max(a,b);
	ans = 7 - ans;
	if(ans == 1){
		cout<<"6/6";
	}
	if(ans == 2){
		cout<<"1/3";
	}
	else if(ans == 3){
		cout<<"1/2";
	}
	else if(ans == 4){
		cout<<"2/3";
	}
	else{
		printf("%d/6",ans);
	}
	return 0;
}

//in the name of god
#include <iostream>
using namespace std;

int main() {
    int x, y;
    cin>>x>>y;
    int a,b = 6;
    if(x>y)
        a=x;
    else if(y>x)
        a==y;
    if (a%2==0){
        a/=2;
        b/=2;
    }
    if (a%3==0){
        a/=3;
        b/=3;
    }
    cout <<a<<"/"<< b;
}

#include <iostream>
 #include <string >
#include <cctype>
using namespace std ;

void main (){
int num =0  ,a =0 ,b=0 , k=0  ;
 int count =0 ;
cin >> num >> a ;
 if ( num>a ) b=(6-(num-1));
 else b=(6-(a-1));
  k = b ;
  if ( b<=3 || b==6)
  cout << b/k <<"/" << 6/k;
  else cout <<b<<"/"<<6;

}

#include <iostream>
using namespace std;
int main()
{
    double a,b;
    cin>>a>>b;
    if(a>b){cout<<(a-1)/b;}else{cout<<(b-1)/a;}
    return 0;
    }

#include <iostream>
using namespace std;

int main()
{
	int y, w, a, b = 6;
	cin >> y >> w;
	if (y >= w)
		a = 6 - y + 1;
	else a = 6 - w + 1;
	if (b%a == 0)
	{
		b = b/a;
		a = 1;
	}
	cout<<a<<"/"<<b;
	return 0;
}

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

int main()
{
    int x,y,sum,shit =6;
    cin >> x >> y;
    x = max (x,y);
    while (x <= 6)
    {
        sum++;x++;
    }
    if (sum == 0){sum=0;shit = 1;}
    if (sum == 1){sum = 1;shit = 6;}
    if (sum == 2){sum = 1;shit = 3;}
    if (sum == 3){sum = 1;shit = 2;}
    if (sum == 4){sum = 2;shit = 3;}
    if (sum == 5){sum = 5;shit = 6;}
    if (sum == 6){sum = 1;shit = 1;}
    cout << sum<<"/" << shit << endl;
}

#include<stdio.h>
int bob(int x,int y){
	int i,j;
	for(i=x;i>=1;i--)
		if(x%i==0 && y%i==0)
			return i;
	}
int main(){
	int i,j,k,l,m,ebob;
	scanf("%d %d",&k,&l);
	if(k>=l) m=k; else m=l;
	m=6-m;
	printf("1/%d",bob(m,6));
	return 0;}

#include <iostream>
using namespace std;
int main() {
	int y, w, z; cin >> y >> w;
	if (w > y) y = w;
	int n = 0; int d = 6;
	for (int i = y; i <= 6; i++) {
		n++;
	}
	//n=3
	if (n == 1) cout << 1 << "/" << 1;
	else if (n == 0) cout << 0 << "/" << 1;
	for (int i = 2; i < 6;i++) {
		if (n % i == 0 && d % i == 0) {
			n = n / i; d = d / i; break; }
	}

	if (n == d) { n = 1; d = 1; }
	cout << n << "/" << d;

	return 0;
}

#include <iostream>
using namespace std;

int main() {

    int y,w,p,c=0,m;
    cin>>y>>w;
    p = y/w;
    m = y;
    if(w>m)
    m=w;

    for(int i=m;i<=6;i++)
    c++;

    if(c<5)
    cout<<"1/"<<6/c<<endl;
    else if(p == 0)
    cout<<"0/1"<<endl;
    else if(p == 1)
    cout<<"1/1"<<endl;

    return 0;
}

#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>

using namespace std;

int a, b, c, d;

int main ()
{
    cin>>a>>b;
    if (a == b)
        c = a;
    else
        c = max(a,b);
    d = 6 - c + 1;
    if (6 % d != 0 && d % 2 != 0)
        cout<<d<<"/"<<6;
    else
        if (d % 2 == 0 && 6 % d == 0)
            cout<<1<<"/"<<1;
        else
            if(d % 2 == 0)
                cout<<d/2<<"/"<<3;
            else
                cout<<1<<"/"<<6/d;
    return 0;
}

#include<bits/stdc++.h>
#define all(v)      ((v).begin()),  ((v).end())
#define sz(v)        ((int)((v).size()))

using namespace std;

int main()
{

	int Y,W,temp=0;
	cin>>Y>>W;
	if(Y==6||W==6){
		cout<<"1/1";
		return 0;
	}
	temp=6-max(Y,W)+1;

	if(6%temp==0){
	temp=6/temp;
		cout<<"1/"<<temp;
	}
	else if(temp%2==0){
		temp/=2;
		cout<<temp<<"/"<<3;
	}
	else cout<<temp<<"/"<<6;

    return 0;
}

        #include<iostream>
        #include<iomanip>
        #include<cmath>
        #include<algorithm>
        #include<string>
        #include<cctype>
        #include<vector>
        #include<utility>
        using namespace std;

        int main()
        { ios_base::sync_with_stdio(0);
    	 cin.tie(0);
    	 cout.tie(0);
		int y,w;
		cin>>y>>w;

	 if (y==w==1)
			cout<<"1"<<"/"<<"1";
		else if(max(y,w)==2)
			cout<<5<<"/"<<6;
		else if(max(y,w)==3)
			cout<<2<<"/"<<3;
		else if(max(y,w)==4)
			cout<<1<<"/"<<2;
		else if(max(y,w)==5)
			cout<<1<<"/"<<3;
		else if(max(y,w)==6)
			cout<<1<<"/"<<6;
		else
			cout<<0<<"/"<<1;
    // system("pause");
        }

#include<iostream>
#include<string>
#include<cstring>
#include <algorithm>
using namespace std;

int main(){
   float y , w , m;
   cin>>y>>w;
   if(y>w)
   {
       m = y / w ;
       cout<<"1/"<<m;
   }
   else if(w>y)
   {
       m = w / y ;
       cout<<"1/"<<m;
   }
   else if(y == 0 || w == 0 )
   {
       cout<<"0/1";
   }
}

#include <iostream>

int main()
{
    int Y,W;
    float z=1;
    std::cin>>Y>>W;
    z+= (Y>=W )?  6-Y : 6-W;
    std::cout<<z/6;

}

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

int main()
{
    int y, w, ch=6, n=0;
    cin >> y >> w;
    int c= max(y, w);
    while (c<=ch)
    {
      n++;
      c++;
    }
    for (int i = 1; i < ch; i++)
    {
        if(n%i==0 and n%i==0)
        {
            n=n/i;
            ch=ch/i;
        }
    }
    if (n==ch)
    {
        cout << 1 << "/"<<1;
        return 0;
    }
    cout << n << "/"<< ch;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int W,Y,Z,maxi;
    int d,n;
    cin>>W>>Y;
    maxi=max(W,Y);
    if(maxi!=6)
        Z=6-maxi+1;
    else
        Z=0;
    switch(Z)
    {
    case 1:
        cout<<"1/6";
        break;
    case 2:
        cout<<"1/3";
        break;
    case 3:
        cout<<"1/2";
        break;
    case 4:
        cout<<"2/3";
        break;
    case 5:
        cout<<"5/6";
        break;
    case 6:
        cout<<"1/1";
        break;
    }
    return 0;
}

#include<iostream>
#include<iterator>  //迭代器
#include<cmath>
#include<iomanip>
#include<algorithm>
#include<cstring>
#include<vector>
#include<map>
#include<stack>
#include<queue>
using namespace std;
typedef long long ll;
#define maxn 0x7fffffff
const ll mod=1e9+7;
const double PI=acos(-1.0);
const double eps=1e-5;
int gcd(int a,int b)
{
    if(b==0) return a;
    return gcd(a,a%b);
}
int main()
{
    int a,b,m,n;
    cin>>a>>b;
    int k=max(a,b);
    k=6-k+1;
    n=k;
    m=6;
    if(gcd(k,6)!=1)
    {
        n/=gcd(k,6);
        m/=gcd(k,6);
    }
    cout<<n<<"/"<<m<<endl;
    return 0;
}

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

int main()
{
    int y, w, ch=6, n=0;
    cin >> y >> w;
    int c= max(y, w);
    while (c<=ch)
    {
      n++;
      c++;
    }
        if (n==ch)
    {
        cout << 1 << "/"<<1;
        return 0;
    }
    for (int i = 1; i < ch; i++)
    {
        if(n%i==0 and n%i==0)
        {
            n=n/i;
            ch=ch/i;
        }
    }

    cout << n << "/"<< ch;
}

#include <iostream>
#include <cmath>
#include <vector>
#include <sstream>
#include <set>
#include <algorithm>
#include <cstdlib>
#include <fstream>
using namespace std;

int main (){

    int  x , y ;
    cin >> x >> y ;

    int  a ;

    a  =  (6 - max (x, y) + 1)      ;
    if (a == 2)
        cout << 1  << "/"<< 3 << endl;
    else if (a == 3)
        cout << 1  << "/"<< 2 << endl;
    else if (a == 6)
        cout << 1 << "/" << endl;
    else
        cout << 1  << "/"<< a << endl;

    return 0 ;

}

#include<bits/stdc++.h>
using namespace std;
int main(){
    int y,w,d;
    cin>>y>>w;
    d=max(y,w);
    d=7-y;
    if(d==1)cout<<"1/1";
    else
    if(d==2)cout<<"1/6";
    else
    if(d==3)cout<<"1/3";
    else
    if(d==4)cout<<"1/2";
    else
    if(d==5)cout<<"2/3";
    else
    if(d==6)cout<<"5/6";
    return 0;
}

#include <bits/stdc++.h>
//31
//
using namespace std;
string alpha="abcdefghijklmnopqrstuvwxyz";
typedef int long long ll;
int main()
{
    ll n,k;
    cin>>n>>k;
    float x=7-max(n,k);
    cout<<x/6;
}

#include <iostream>
#include<algorithm>
using namespace std;

int main() {
	int e,f;
	cout<<"Enter the value of e and f : ";
	cin>>e>>f;
	int a;
	a=max(e,f);
	cout<<"Maximum is"<<a<<endl;
	int d;
float x;
	d=6-a + 1;
	cout<<d<<endl;
	switch(d)
	{

		case 1:
		x= (float)1/6;
		break;

		case 2:
		x=(float)1/3;
		break;

		case 3:
		x=(float)1/2;
		break;

		case 4:
		x=(float)2/3;
		break;

		case 5:
		x=(float)5/6;
		break;

		case 6:
		x=1/1;
		break;

		default :
		x=0/1;
		break;
	}
	cout<<x<<endl;

	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int a,b,c,x;
int main(){
    cin>>a>>b;
    c=max(a,b);
    x=7-c;
    if(x==6)cout<<"1/1";
        else if(x==1)cout<<"0/1";
        else{
    	    if(x%2==0)cout<<x/2<<"/"<<"3";
    	    else if(x%3==0)cout<<x/3<<"/"<<"2";
    	    else cout<<x<<"/"<<"6";
	    }
    return 0;
}

#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
int a,b;int n;int dp[10000];int ans;int k;int cu;int mod;
int gcd(int c,int d){
	//cout<<c<<"  "<<d<<endl;
	if(d==0){
		return c;
	}else{
		return gcd(d,c%d);
	}

}
int main(){
	cin>>a>>b;
	k=max(a,b);
	if(k>=6){
		cout<<"0/1"<<endl;
		return 0;
	}
	ans=7-k;
	mod=gcd(6,ans);

	cout<<ans/mod<<"/"<<6/mod<<endl;
	//cout<<mod<<endl;
	return 0;

}

#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
using namespace std;
int a,b;
int main(){
	cin>>a>>b;
	a = max(a,b);
	if(a == 1){
		cout<<"1/1";
	}else if(a == 2){
		cout<<"5/6";
	}else if(a == 3){
		cout<<"2/3";
	}else if(a == 4){
		cout<<"1/2";
	}else if(a == 5){
		cout<<"1/3";
	}else if(a == 6){
		cout<<"0/1";
	}
	return 0;
}

#include <iostream>

int main()
{
    int Y,W,z=1;

    std::cin>>Y>>W;
    z+= (Y>=W )?  6-Y : 6-W;

    switch(z)
    {
    case 1:
    std::cout<<"1/6";
    break;
    case 2:
    std::cout<<"1/3";
    break;
    case 3:
    std::cout<<"1/2";
    break;
    case 4:
    std::cout<<"2/3";
    break;
    case 5:
    std::cout<<"5/6";
    break;
    case 6:
    std::cout<<'1';
    break;
    }

}

#include <bits/stdc++.h>

using namespace std;

int main(){

    int a,b,maior;
    int num,den;

    cin >> a >> b;

    maior=max(a,b);

    num=7-maior;
    den=6;

    if(num == 1){
        cout << "0/1\n";
        return 0;
    }
    if(num == 2){
        cout << "1/1\n";
        return 0;
    }
    else{
        if(6%num == 0){
            den=6/num;
            num/=num;
        }
        cout << num << "/" << den << endl;
        return 0;
    }

}

#include <iostream>

using namespace std;

int main()
{
    int y,w,max=0,count=0;
    cin>>y>>w;
    if(y>w)
    {
        max=y;
    }if(w>=y)
    {
        max=w;
    }
    for(int i=1;i<=6;i++)
    {
        if(i>=max)
            count++;
    }
    int x=6%count;

    if (count==2)
    {
        cout<<"1/3";
    }if (count==3)
    {
        cout<<"1/2";
    }if(count==6)
    {
        cout<<"1/6";
    }if(count==4)
    {
        cout<<"2/3";
    }if(count==5)
    {
        cout<<"5/6";
    }

    return 0;
}

//create yourSelf :D ^_^
//Change the Word ;) (y)

#include <stdio.h>
#include <stdlib.h>
#include <ctype.h>
#include <sstream>
#include <string>
#include <iostream>
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <stdio.h>
#include <ctype.h>
#include <sstream>
#include <queue>
#include <stack>
#include <iomanip>
#include <functional>
#include <math.h>
#include <cstring>
#include <stdio.h>

using namespace std;

map < int , int > ll;
map < int , int > ::iterator it;
#define For(i , x) for ( int i = 1 ;i <= x ;++i)
#define rep(k , h) for ( int k = 0 ; k < h ;k++)
#define sz size()

multiset < char > data;
multiset < char > ::reverse_iterator its;
set < char > datas ;
set <char > ::iterator itss;

int main()
{
int a ,  y , w ;

cin >> y >> w ;

a = 6 - max(y , w) +  1 ;

//cout << a<< endl;

if( a == 0)
    cout<<"0/1"<< endl;
if( a == 1)
    cout<<"1/1"<< endl;
if(a > 1)
{

    cout<< a/a <<"/"<<6/a<< endl;
}
    return 0 ;
}

#include<iostream>
#include<string>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
using namespace std;
int main(){
	std::ios_base::sync_with_stdio(0);
	cin.tie(NULL);
	cout.tie(NULL);
	int n, k;
	cin >> n >> k;
	int a = min(n, k);
	int b = max(n, k);
	 int c=(b-1)-6;
	 c = 6 / c;
	if (c == 0)
		cout << 0 << "/" << 1;
	else if (c==1)
		cout << 1 << "/" << 1;
	else
		cout << 1 << "/" << c;
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int maxs(int x, int y)
{
	int z = y;
	while(x%y!=0)
	{
		z = x%y;
		x = y;
		y = z;
	}
	return z;
}
int victory(int a,int b){
    if(a==2&&b==2||a==1&&b==2||a==2&&b==1) cout<<"5/6";
	int k=0,q;
	if(a==0&&b==0)cout<<"1/1";
	q=max(a,b);
	for(int i=q;i<=6;i++){
		k++;
	}
	int n=0;
	n=6-k;
	int e;
	e=maxs(n,6);
	int es;
	es=6/e;
	if(e==0)cout<<"0/1";
	else cout<<"1/"<<es;
}
int main(){
	int a=0,b=0;
	cin>>a>>b;
	victory(a,b);
	return 0;
}

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

int main()
{
	int n,m;
	scanf("%d %d",&n,&m);
	n=max(n,m);
	switch(n)
	{
		case 1:printf("1/1");break;
		case 2:printf("5/6");break;
		case 3:printf("3/2");break;
		case 4:printf("1/2");break;
		case 5:printf("1/3");break;
		case 6:printf("1/6");break;
	}
	return 0;
}