#include <iostream>

#include <cstdio>

using namespace std;

#define maxn 1000010

int h_prime[maxn], h_sei[maxn], num[maxn];

void table()

{

        h_prime[] = ;

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

        {

               if (h_prime[i]) continue;

               for (int j = i * ; j < maxn; j += i * )

                       h_prime[j] = ;

        }

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

               for (int j = ; j < maxn; j += )

               {

                       if (i*j > maxn) break;

                       if (!h_prime[i] && !h_prime[j])

                              h_sei[i*j] = ;

               }

        int ans = ;

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

        {

               if (h_sei[i]) num[i] = ++ans;

               else num[i] = ans;

        }

}

int main()

{

        int n;

        table();

        while (scanf("%d", &n)!=EOF)

        {

               if (n == ) break;

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

        }

        return ;

}