if(n<0){
		printf("-");
        n=abs(n);
		}

if(n==1){
        printf("1\n");
        continue;
        }

printf("0.");

int i=1;
        flage[1]=true;
        while(i){
            i*=10;
            printf("%d",i/n);
            i%=n;
            if(flage[i])break;
            flage[i]=true;
        }

#include<iostream>
#include<cstdio>
#include<string.h>
#include<stdio.h>
#include<stdlib.h>
#include<algorithm>
#include<stack>
#include<queue>
#define lowbits(x) ((-x)&x)
using namespace std;
const int INF = 0x3f3f3f3f;
const int N = 1e6+5;
typedef long long ll;
int gcd(int a,int b)
{
    return b>0 ? gcd(b,a%b):a;
}
int n,m;
int a[N];
int find(int n,int x){
    int l=-1,r=n;
    while(l+1<r){
        int mid = l+r>>1;
        if(a[mid]<=x) l =mid;
        else r=mid;
    }
    return r;
}
bool flage[N];
int main()
{
    ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    int n;
    int t;
    scanf("%d",&t);
    while(t--){
        scanf("%d",&n);
        memset(flage,false,sizeof(flage));
        if(n<0){
            printf("-");
            n=abs(n);
        }
        if(n==1){
            printf("1\n");
            continue;
        }
        printf("0.");
        int i=1;
        flage[1]=true;
        while(i){
            i*=10;
            printf("%d",i/n);
            i%=n;
            if(flage[i])break;
            flage[i]=true;
        }
    printf("\n");
    }
    return 0;
}