fork download
copy 
  1. def Prime(n):
  2. 	if n ==0 or n ==1:
  3. 		return False 
  4. 	for i in range(2, int(n**0.5)+1):
  5. 		if n%i==0:
  6. 			return False 
  7. 		else:
  8. 			return True 
  9. n = int(input())
  10. print(Prime(n))
Success #stdin #stdout 0.03s 9864KB
comments (?)
stdin
copy 
10
stdout
copy 
False
https://ideone.com/SfGBLo
language:
Python 3 (python  3.9.5)
created:
8 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!