how would i solve this using for loops or while loop in python?

truncatable_prime (n): check whether a number is a "right-truncatable prime" and return bool result. A right-truncatable prime is a prime which remains prime when the last (rightmost) digit is successively removed. Assume: n is a positive integer. Restrictions: no extra restrictions. truncatable_prime (2) rightarrow True truncatable_prime (113) rightarrow False truncatable_prime(5939) rightarrow #5939, 593, 59, and 5 are all primes