title: Find Minimum Number Divided Make Number Perfect Square
signature: def find_minimum_number_divided_make_number_perfect_square(n):
test_code: import array
  import bisect
  import collections
  import datetime
  import functools
  import heapq
  import itertools
  import math
  import queue
  import re
  import string
  import sys
  from typing import Any, Dict, List, Optional, Set
  
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  def validate_solution(actual, expected):
      return actual == expected
  
  def driver(n, expected):
      try:
          if validate_solution(PLACEHOLDER_FN_NAME(
              n),
              expected
          ):
              return "PASSED"
          return "FAILED"
      except Exception as exception_obj:
          return type(exception_obj).__name__
      
  if __name__ == "__main__":
      result = driver(95, 95)
      print(f"TEST-0...{result}")
  
      result = driver(48, 3)
      print(f"TEST-1...{result}")
  
      result = driver(3, 3)
      print(f"TEST-2...{result}")
  
      result = driver(10, 10)
      print(f"TEST-3...{result}")
  
      result = driver(82, 82)
      print(f"TEST-4...{result}")
  
      result = driver(1, 1)
      print(f"TEST-5...{result}")
  
      result = driver(77, 77)
      print(f"TEST-6...{result}")
  
      result = driver(99, 11)
      print(f"TEST-7...{result}")
  
      result = driver(23, 23)
      print(f"TEST-8...{result}")
  
      result = driver(61, 61)
      print(f"TEST-9...{result}")
  
      sys.exit(0)
source_py: def find_minimum_number_divided_make_number_perfect_square(n):
      count = 0
      ans = 1
      while ((n % 2) == 0):
          count += 1
          n //= 2
      if ((count % 2) is not 0):
          ans *= 2
      for i in range(3, (int(math.sqrt(n)) + 1), 2):
          count = 0
          while ((n % i) == 0):
              count += 1
              n //= i
          if ((count % 2) is not 0):
              ans *= i
      if (n > 2):
          ans *= n
      return ans
source_cpp: int find_minimum_number_divided_make_number_perfect_square(int n) {
    int count = 0, ans = 1;
    while ( n % 2 == 0 ) {
      count ++;
      n /= 2;
    }
    if ( count % 2 ) ans *= 2;
    for ( int i = 3;
    i <= sqrt ( n );
    i += 2 ) {
      count = 0;
      while ( n % i == 0 ) {
        count ++;
        n /= i;
      }
      if ( count % 2 ) ans *= i;
    }
    if ( n > 2 ) ans *= n;
    return ans;
  }