#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>

int isPrime(int n);
int no_of_multiples(int n,int j);

int main(){
   int g,n,i,j,isp=0,nf=0;
    
    scanf("%d",&g);
    for(i=0;i<g;i++)
        {
        scanf("%d",&n);
        for(j=1;j<=n;j++)
            {isp =0 ;
             nf = 0;
            isp = isPrime(j);
            
            if(isp == 1)
                nf=no_of_multiples(n,j);
          //  printf("for game %d , value of j is %d, isp is %d, nf is %d\n",i,j,isp,nf);
        }
    }
    
    return 0;
} 

int isPrime(int n)
    {
    int i,flag=0;
    for(i=2; i<=n/2; ++i)
    {
        // condition for nonprime number
        if(n%i==0)
        {
            flag=1;
            break;
        }
    }

    if(n == 1)
        return 0;
    else 
    if (flag==0)
       // printf("%d is a prime number.",n);
        return 1;
    else
       // printf("%d is not a prime number.",n);
    
    return 0;
}

int no_of_multiples(int n,int j)
    {
    int i,ans=0;
    for(i=1;i<=n;i++)
        {
        if(i%j == 0 && i != 0)
            ans++;
    }
    return ans;
}