6. 장난꾸러기

import java.util.*;

class Main {
	public void solution(int N, int[] arr) {
		int a = 0, b = 0;
		for (int j = 1; j < N; j++) {
			if (arr[j] < arr[j - 1])
				b = j + 1;
		}
		for (int i = 0; i < N; i++) {
			if (arr[i] > arr[b - 1]) {
				a = i + 1;
				break;
			}
		}
		System.out.print(a + " " + b);
	}

	public static void main(String[] args) {
		Main T = new Main();
		Scanner kb = new Scanner(System.in);
		int N = kb.nextInt();
		int[] arr = new int[N];
		for (int i = 0; i < N; i++)
			arr[i] = kb.nextInt();
		T.solution(N, arr);
		kb.close();
	}
}

 

import java.util.*;

class Main {
	public ArrayList<Integer> solution(int N, int[] arr) {
		ArrayList<Integer> answer = new ArrayList<>();
		int[] tmp = arr.clone();
		Arrays.sort(tmp);
		for (int i = 0; i < N; i++) {
			if (arr[i] != tmp[i])
				answer.add(i + 1);
		}
		return answer;
	}

	public static void main(String[] args) {
		Main T = new Main();
		Scanner kb = new Scanner(System.in);
		int N = kb.nextInt();
		int[] arr = new int[N];
		for (int i = 0; i < N; i++)
			arr[i] = kb.nextInt();
		for (int x : T.solution(N, arr))
			System.out.print(x + " ");
		kb.close();
	}
}