#include<cmath>

#include<cstdio>

#include<cstring>

#include<iostream>

#include<algorithm>

using namespace std;

char s[];

int l,r,num,num1,num2,num3;

int gcd(int x,int y){

    return x==?y:gcd(y%x,x);

}

int pow(int a,int b){

    int s=;

    for(int i=;i<=b;i++)    s*=a;

    return s;

}

void work1(){

    int len=strlen(s),ans1,ans2;

    for(int i=len-;i>=;i--){

        if(s[i]>=''&&s[i]<=''&&(s[i+]==')'||r)){

            num1+=pow(,r)*(s[i]-'');

            r++;

        }

        if(s[i]>=''&&s[i]<=''&&(s[i+]=='('||l||s[i+]=='.')){

            num2+=pow(,l)*(s[i]-'');

            l++;

        }

        if(s[i]=='.'){ ans1=l;ans2=r; }

    }

    l=num1-num2;r=pow(,ans2)-pow(,ans1);

    int GCD=gcd(l,r);

    printf("%d/%d",l/GCD,r/GCD);

    exit();

}

void work2(){

    int len=strlen(s);

    for(int i=len-;i>=;i--){

        if(s[i]>=''&&s[i]<=''){

            num3+=pow(,num)*(s[i]-'');

            num++;

        }

        if(s[i]=='.')    num1=num;

    }

    l=num3;r=pow(,num1);

    int GCD=gcd(l,r);

    printf("%d/%d",l/GCD,r/GCD);

    exit();

}

int main(){

     cin>>s;

     int len=strlen(s);

     for(int i=;i<len;i++)

         if(s[i]=='('){ work1();break; }

    work2();

}