import java.io.* ;
import java.util.* ;
import java.text.* ;
import java.math.* ;
import java.util.regex.* ;
class Solution {
public static void main
( String [ ] args
) { try {
int line= 0 ;
line
= Integer .
parseInt ( br.
readLine ( ) ) ; for ( int i= 0 ; i< line; i++ )
{
int n
= Integer .
parseInt ( br.
readLine ( ) ) ; System .
out .
println ( countPrime
( ways
( n
) ) ) ; }
}
{
}
}
static int ways( int n)
{
int way= 1 ;
for ( int i= 1 ; i<= n/ 4 ; i++ )
{
way+= n- ( 4 * i) + i;
}
return way;
}
static int countPrimes( int m)
{
int p= 0 ;
for ( n= 2 ; n<= m; n++ )
{
if ( isPrime( n) )
{
p++;
}
}
return p;
}
static boolean isPrime( int n)
{
for ( int i= 2 ; i< n/ 2 ; i++ )
{
if ( n% i== 0 )
return false ;
}
return true ;
}
}
aW1wb3J0IGphdmEuaW8uKjsKaW1wb3J0IGphdmEudXRpbC4qOwppbXBvcnQgamF2YS50ZXh0Lio7CmltcG9ydCBqYXZhLm1hdGguKjsKaW1wb3J0IGphdmEudXRpbC5yZWdleC4qOwoKY2xhc3MgU29sdXRpb24gewoKICAgIHB1YmxpYyBzdGF0aWMgdm9pZCBtYWluKFN0cmluZ1tdIGFyZ3MpIHsKICAgICAgICB0cnl7CiAgICAgICAgaW50IGxpbmU9MDsKICAgICAgICBCdWZmZXJlZFJlYWRlciBicj0gbmV3IEJ1ZmZlcmVkUmVhZGVyKG5ldyBJbnB1dFN0cmVhbVJlYWRlcihTeXN0ZW0uaW4pKTsKICAgICAgICBsaW5lPUludGVnZXIucGFyc2VJbnQoYnIucmVhZExpbmUoKSk7CiAgICAgICAgZm9yKGludCBpPTA7aTxsaW5lO2krKykKICAgICAgICB7CiAgICAgICAgCWludCBuPUludGVnZXIucGFyc2VJbnQoYnIucmVhZExpbmUoKSk7CiAgICAgICAgCVN5c3RlbS5vdXQucHJpbnRsbihjb3VudFByaW1lKHdheXMobikpKTsKICAgICAgICB9CiAgICAgICAgfQogICAgICAgIGNhdGNoKEV4Y2VwdGlvbiBlKQogICAgICAgIHsKCiAgICAgICAgfQogICAgfQogICAgc3RhdGljIGludCB3YXlzKGludCBuKQoJewoJCWludCB3YXk9MTsKCQlmb3IoaW50IGk9MTtpPD1uLzQ7aSsrKQoJCXsKCQkJd2F5Kz1uLSg0KmkpK2k7CgkJfQoJCXJldHVybiB3YXk7CiAgICB9CiAgICBzdGF0aWMgaW50IGNvdW50UHJpbWVzKGludCBtKQogICAgewogICAgCWludCBwPTA7CiAgICAJZm9yKG49MjtuPD1tO24rKykKICAgIAl7CiAgICAJCWlmKGlzUHJpbWUobikpCiAgICAJCXsKICAgIAkJCXArKzsKICAgIAkJfQogICAgCX0KICAgIAlyZXR1cm4gcDsKCiAgICB9CiAgICBzdGF0aWMgYm9vbGVhbiBpc1ByaW1lKGludCBuKQogICAgewogICAgCWZvcihpbnQgaT0yO2k8bi8yO2krKykKICAgIAl7CiAgICAJCWlmKG4laT09MCkKICAgIAkJCXJldHVybiBmYWxzZTsKICAgIAl9CiAgICAJcmV0dXJuIHRydWU7CiAgICB9Cn0=
compilation info
Main.java:17: error: cannot find symbol
System.out.println(countPrime(ways(n)));
^
symbol: method countPrime(int)
location: class Solution
Main.java:37: error: cannot find symbol
for(n=2;n<=m;n++)
^
symbol: variable n
location: class Solution
Main.java:37: error: cannot find symbol
for(n=2;n<=m;n++)
^
symbol: variable n
location: class Solution
Main.java:37: error: cannot find symbol
for(n=2;n<=m;n++)
^
symbol: variable n
location: class Solution
Main.java:39: error: cannot find symbol
if(isPrime(n))
^
symbol: variable n
location: class Solution
5 errors
stdout