input: Write a function that takes a number `n` as input and prints all prime numbers from 2 to `n` (inclusive). Follow the given code structure to rewrite it in Python.
  
  ### Function:
  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)
  
  ### Assertions:
  assert find_primes(10) == None
  assert find_primes(20) == None
  assert find_primes(1) == None
  assert find_primes(0) == None
  assert 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)