#include<bits/stdc++.h>
#define int long long
using namespace std;
void ts(){cout<<"IAKIOI\n";}
inline int read(){
	int n=0,f=1,ch=getchar();
	while(ch<'0'||ch>'9'){
		if(ch=='-')f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9'){
		n=n*10+ch-'0';
		ch=getchar();
	}
	return n*f;
}
const int mod=998244353;
struct mint{
    int x;mint(int o=0){x=o;}mint&operator+=(mint a){return(x+=a.x)%=mod,*this;}mint&operator-=(mint a){return(x+=mod-a.x)%=mod,*this;}
    mint&operator*=(mint a){return(x=1ll*x*a.x%mod),*this;}mint&operator^=( int b){mint a=*this;x=1;while(b)(b&1)&&(*this*=a,1),a*=a,b>>=1;return*this;}
    mint&operator/=(mint a){return*this*=(a^=mod-2);}friend mint operator+(mint a,mint b){return a+=b;}friend mint operator-(mint a,mint b){return a-=b;}
    friend mint operator*(mint a,mint b){return a*=b;}friend mint operator/(mint a,mint b){return a/=b;}friend mint operator^(mint a,int b){return a^=b;}
    mint operator-(){return 0-*this;}bool operator==(const mint b)const{return x==b.x;}
};
signed main(){
	for(int greg=1;greg<=18;greg++){
		int x=read(),y=read();
		int k=__gcd(x,y);x/=k,y/=k;
		if(x%y==0){printf("%lld\n",x/y);}
		else{
			printf("%lld.",x/y);
			x%=y;
			vector<int> vis(1000005,0);
			int s=1;
			vector<int> con;
			bool ok=0;
			while(1){
				if(!x)break;
				int p=x*10/y;
				if(vis[x]){
					for(int i=0;i<vis[x]-1;i++)putchar(con[i]+'0');
					putchar('(');
					for(int i=vis[x]-1;i<(int)con.size();i++)putchar(con[i]+'0');
					putchar(')');
					ok=1;
					break;
				}
				con.push_back(p);
				vis[x]=s++;
				x=(x*10)%y;
			}
			if(!ok)for(int i=0;i<(int)con.size();i++)putchar(con[i]+'0');
			printf("\n");
		}
	}
	return 0;
}