input: Write a function to rewrite the given code snippet that finds prime numbers using Python. The function should take an integer `n` and print all prime numbers from 2 to `n`.
  
  def find_primes(n):
      def is_prime(num):
          for i in range(2, int(num ** 0.5) + 1):
              if num % i == 0:
                  return False
          return True
  
      for n in range(2, n+1):
          if is_prime(n):
              print(n)
  
  assert print(find_primes(10))==print(2, 3, 5, 7)
  assert print(find_primes(20))==print(2, 3, 5, 7, 11, 13, 17, 19)
  assert print(find_primes(5))==print(2, 3, 5)
  assert print(find_primes(0))==None
  assert print(find_primes(-5))==None
output: def find_primes(n):
      def is_prime(num):
          for i in range(2, int(num ** 0.5) + 1):
              if num % i == 0:
                  return False
          return True
  
      for num in range(2, n + 1):
          if is_prime(num):
              print(num)