problem35euler

import java.util.BitSet;
public class problem35 
{
	static BitSet a ;
	public static void main(String[] args) 
	{

		a = new BitSet(1000000);


		int i =2,j=0;
		for(i=2;(i*i)<=1000000;i=i+1)
		{
			if(!a.get(i))
			{
				for(j=i+i;j<=1000000;j=j+i)
				{
					a.set(j);

				} 
			}

		}
		int c =0;
		for (int z = 2; z <= 1000000; z++) 
		{
			if(!a.get(z)&&rotar(z))
				c++;

		}
		System.out.println(c);
	}
	public static boolean rotar(int n)
	{
		String y = Integer.toString(n);
		int l = y.length();

		if(l==1)


			return true;

		else
		{	;
		int c =1;
		while(c