Write a function that takes an integer n and asks the user to enter that many numbers and returns the largest and smallest numbers that the user entered. If the user ever enters the same number twice in a row, stop there and return the current largest and smallest.

For this problem, do this by reading the numbers into a dynamically allocated array first.