My solution to Project Euler problem

Project Euler : 10001 prime

#include<iostream>

bool isPrime(long long  kil)
{
	for (long long i=2;i<kil;i++)
	{
		if(kil%i==0)
		{
			return false;
		}
	}
	return true;
}


using namespace std;
int main(void)
{
	long long i=2,primeNumber=0;
	while(true)
	{
		if(isPrime(i))
		{
			primeNumber++;
			
		}
		if(primeNumber==10001)
		{
			break;	
		}
		i++;
	}
	cout<<i<<endl;
	

}