Checking and Counting Prime Numbers in C

Prime.c

#include<stdio.h>

int isPrime(int n)
{
	if (n < 2)
		return 0;
	else if (n == 2)
		return 1;
	else
	{
		int i;
		int p;
		for(i = 2; i < n; i++)
		{
			p = n % i;
			if (p == 0)
			{
				return 0;
				break;
			}
		}
		return 1;
	}
}

main()
{
	int c;
	int x;
	int ans;
	for(c = 2; c < 2500001; c++)
	{
		ans = isPrime(c);
		if(ans == 1)
			x++;
	}
	printf("%d \n", x);
}