I'll admit, I've been stuck on this task for 2 hours because I felt anything more than 10 lines of code was too long

In the end, I ended up with this:

```
def is_prime(x):
if x == 0:
return False
elif x == 1:
return False
elif x == 2 or x == 3:
return True
elif x > 0:
for n in range(2, x - 1):
if x % n == 0:
result = False
break
else:
result = True
return result
else:
return False
```

Is there a cleaner, shorter, more elegant way of writing this is_prime() function? (without using built in functions which we haven't covered in previous chapters yet)