def get_algorithm_result(n):
  if type(n) == type([]):
    largest = n[0]
  for item in n:
    if largest < item:
      largest = item
    elif largest == n[-1]:
      return largest
    else:
      pass
  return largest





def prime_number(num):
    for x in range(2, num):
        if num % x == 0: return False
    return True