#include <iostream>

#include <cstdio>

#include <cstring>

#include <cmath>

#include <algorithm>

using namespace std;

#define N 207

int prime[N],flag[N],num[N];

int c[],tc[];

int ci;

void doit()

{

    int i,j,n;

    ci = ;

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

        flag[i]=;

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

    {

        if(flag[i])

           prime[ci++]=i;

        for(j=;j<ci&&i*prime[j]<=;j++)

        {

            flag[i*prime[j]]=;

            if(i%prime[j]==)

               break;

        }

    }

}

int main()

{

    doit();

    int i,j,k,t,n;

    int maxi = ;

    for(i=;i<ci;i++)

    {

        num[i] = /prime[i]+;

        maxi += prime[i]*num[i];

    }

    scanf("%d",&t);

    while(t--)

    {

        scanf("%d",&n);

        for(i=;i<=maxi;i++)

            c[i] = tc[i] = ;

        for(i=;i<=prime[]*num[];i+=prime[])

            c[i] = ;

        for(i=;i<ci;i++)

        {

            for(j=;j<=maxi;j++)

            {

                for(k=;k+j<=maxi && k<=prime[i]*num[i];k+=prime[i])

                    tc[k+j] += c[j];

            }

            for(j=;j<=maxi;j++)

            {

                c[j] = tc[j];

                tc[j] = ;

            }

        }

        printf("%d\n",c[n]);

    }

    return ;

}