I am trying to write a faster program for checking if a number n is prime by only checking the range (2, n**0.5) instead of going all the way to n.

So far I have but it returns True for 99. What am I doing wrong?

```
def is_prime(x):
if x < 2:
return False
elif x == 2 or x == 3:
return True
else:
for n in range(2, int(x**0.5)):
if x % n == 0:
return False
else:
return True
print is_prime(99)
```