6 6
 1 4
 4 4
 3 3
 6 4
 6 3
 5 4
 5 6
 3 4
 1 3
 3 2
 5 5
 1 1
 2 1
 3 1
 3 5
 1 6
 6 5
 2 3
 4 3
 2 2
 3 6
 1 2
 6 1
 2 5
 4 5
 1 5
 6 2
 4 6
 5 1
 4 1
 5 2
 2 4
 2 6
 5 3

1/6
 1/2
 1/2
 2/3
 1/6
 1/6
 1/3
 1/6
 1/2
 2/3
 2/3
 1/3
 1/1
 5/6
 2/3
 1/3
 1/6
 1/6
 2/3
 1/2
 5/6
 1/6
 5/6
 1/6
 1/3
 1/3
 1/3
 1/6
 1/6
 1/3
 1/2
 1/3
 1/2
 1/6
 1/3

#include <iostream>
#include<fstream>
#include<vector>
#include<utility>
#include<algorithm>
#include<stack>
#include<string.h>
#include<math.h>
typedef long long ll;

using namespace std;

const ll mod=1000000007;

#define for1(a,b)  for(int i=a;i<b;i++)
#define for2(a,b) for(int j=a;j<b;j++)
#define for3(a,b) for(int x=a;x<b;x++)
#define for4(a,b) for(int y=a;y<b;y++)
#define F first
#define S second
#define pb push_back


template<class T>
void read(T&a)
{
    cin>>a;
}
template<class T1,class T2>
void read(T1&a,T2&b)
{
    cin>>a>>b;
}
template<class T>
void read(T *a,int size)
{
    for1(0,size)
    {
        read(a[i]);
    }
}
void read(vector<int>v,int size)
{
    for1(0,size)
    cin>>v[i];
}
template<class T>
void print(T a)
{
    cout<<a;
}
template<class T>
void print(T*a,int size)
{
    for1(0,size)
    {
        print(a[i]);
        print("\n");
    }
}

void print(int *a,int size)
{
    for1(0,size)
    {
        print(a[i]);
        print("\n");
    }
}
int *array,*temp;
void sort(int low,int mid,int high)
{
    for1(low,high+1)
    {
        temp[i]=array[i];
    }
    int i=low,j=mid+1,k=low;
    while(i<=mid&&j<=high)
    {
        if(temp[i]<temp[j])
        {
            array[k]=temp[i];
            i++;
        }
        else
        {
            array[k]=temp[j];
            j++;
        }
        k++;
    }
    while(i<=mid)
    {
        array[k]=temp[i];
        i++;
        k++;
    }
}
void merge(int low,int high)
{
    if(low<high)
    {
        int mid=low+(high-low)/2;
        merge(low,mid);
        merge(mid+1,high);
        sort(low,mid,high);
    }
}
void prepare(int *a,int size)
{
    array=new int[size];
    temp=new int[size];
    for1(0,size)
    {
        array[i]=a[i];
    }
    merge(0,size-1);
}

vector<int>ans;
void solve()
{
    int n,m;
    read(n,m);
    int x=6-max(m,n);
    if(n==m)
        cout<<1<<"/"<<1;
    else if(n==6||m==6)
        cout<<0<<"/"<<1;
    else
    {
        if(x%2==0)
            cout<<x/2<<"/"<<6*2/x;
        else if(x%3==0)
            cout<<x/3<<"/"<<6*3/x;
        else cout<<x<<"/"<<6;
    }

}


int main()
{
    int t=1;
 //   read(t);
    for1(0,t)
    solve();
    /*for1(0,t)
    {
        cout<<ans[i]<<endl;
    }*/

    return 0;
}
