#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=100100;
int n,d,a[maxn],last[maxn];
inline int MAIN(){
#define MINE
#ifdef MINE
	freopen("fracdec.in","r",stdin);
	freopen("fracdec.out","w",stdout);
#endif
	scanf("%d%d",&n,&d);
	printf("%d.",n/d);
	n%=d;
	if(!n){
		printf("0");
		return 0;
	}
	for(;;){
		n*=10;
		a[++a[0]]=n/d;
		n%=d;
		if(!n||last[n])break;
		last[n]=a[0];
	}
	if(!n){
		for(int i=1;i<=a[0];i++)printf("%d",a[i]);
		return 0;
	}
	if(a[1]==a[a[0]]){
		printf("(");
		for(int i=1;i<a[0];i++)printf("%d",a[i]);
		printf(")");
	}
	else{
		for(int i=1;i<=last[n];i++)printf("%d",a[i]);
		printf("(");
		for(int i=last[n]+1;i<=a[0];i++)printf("%d",a[i]);
		printf(")");
	}
	return 0;
}
int haha=MAIN();
int main(){;}