Java Code To Find the Maximum number in a set

Problem:

Find the maximum number in a set of n numbers

Solution:

package array.programs;

import java.util.Scanner;

public class MaximumNumber {

int[] numbers;
int max;

public static void main(String[] args) {
MaximumNumber maximumNumber = new MaximumNumber();
maximumNumber.getTheNumbers();
maximumNumber.findMaximum();
maximumNumber.printTheResult();

}

public void getTheNumbers(){
Scanner scanner = new Scanner(System.in);
System.out.println("how many numbers");
numbers = new int[scanner.nextInt()];
for (int i = 0; i < numbers.length; i++) {
System.out.println("enter number");
numbers[i] = scanner.nextInt();
}
scanner.close();
}

public void findMaximum(){
max = numbers[0];
for (int i = 0; i < numbers.length; i++) {
if(numbers[i] > max){
max = numbers[i];
}
}
}

public void printTheResult(){
System.out.println("the maximum value is " + max);
}

}

Output:

how many numbers
10
enter number
23
enter number
33
enter number
444
enter number
555
enter number
44
enter number
333
enter number
55667
enter number
444
enter number
33445
enter number
6666
the maximum value is 55667