input: Write a python function to identify the smallest natural number whose factorial can be divided by x without a remainder.  
  assert find_Smallest_Factorial_Divisor(10) == 5  
  assert find_Smallest_Factorial_Divisor(15) == 5  
  assert find_Smallest_Factorial_Divisor(5) == 4
output: def find_Smallest_Factorial_Divisor(x):
      from math import factorial
      n = 1
      while True:
          if factorial(n) % x == 0:
              return n
          n += 1