Get sum of two biggest integers in array

MaxPairwiseProduct.java

 static long getMaxPairwiseProduct(int[] numbers) {
        long result = 0;
        int n = numbers.length;

        int max_position1 = -1;
        for (int i = 0; i < numbers.length; i++) {
            if ((max_position1 == -1) || (numbers[i] > numbers[max_position1])) {
                max_position1 = i;
            }
        }

        int max_position2 = -1;
        for (int i = 0; i < numbers.length; i++) {
            if (((max_position2 == -1) || (numbers[i] > numbers[max_position2]))
                    &&  (max_position1 != i)) {
                max_position2 = i;
            }
        }
        System.out.println(numbers[max_position1] + " " + numbers[max_position2]);
        result = numbers[max_position1] + numbers[max_position2];
        return result;
    }