#include<stdio.h>
int M[121212], a[121212],S[121212];
int min(int a, int b) { if (a < b)return a; return b; }
double max(double a, double b) { if (a > b)return a; return b; }
int main() {
	int n;
	int i, j;
	scanf("%d", &n);
	for (i = 0; i < n; i++)scanf("%d", &a[i]);
	S[n-1] = M[n - 1] = a[n - 1];
	for (i = n - 2; i >= 0; i--)S[i] = S[i + 1] + a[i], M[i] = min(M[i + 1], a[i]);
	double mx = -1e9;
	for (i = 1; i < n - 1; i++) mx = max(mx, (double)(S[i] - M[i]) / (n - i - 1));
	for (i = 1; i < n - 1; i++)if (mx == (double)(S[i] - M[i])/(n-i-1))printf("%d ", i);
	return 0;
}

I2luY2x1ZGU8c3RkaW8uaD4KaW50IE1bMTIxMjEyXSwgYVsxMjEyMTJdLFNbMTIxMjEyXTsKaW50IG1pbihpbnQgYSwgaW50IGIpIHsgaWYgKGEgPCBiKXJldHVybiBhOyByZXR1cm4gYjsgfQpkb3VibGUgbWF4KGRvdWJsZSBhLCBkb3VibGUgYikgeyBpZiAoYSA+IGIpcmV0dXJuIGE7IHJldHVybiBiOyB9CmludCBtYWluKCkgewoJaW50IG47CglpbnQgaSwgajsKCXNjYW5mKCIlZCIsICZuKTsKCWZvciAoaSA9IDA7IGkgPCBuOyBpKyspc2NhbmYoIiVkIiwgJmFbaV0pOwoJU1tuLTFdID0gTVtuIC0gMV0gPSBhW24gLSAxXTsKCWZvciAoaSA9IG4gLSAyOyBpID49IDA7IGktLSlTW2ldID0gU1tpICsgMV0gKyBhW2ldLCBNW2ldID0gbWluKE1baSArIDFdLCBhW2ldKTsKCWRvdWJsZSBteCA9IC0xZTk7Cglmb3IgKGkgPSAxOyBpIDwgbiAtIDE7IGkrKykgbXggPSBtYXgobXgsIChkb3VibGUpKFNbaV0gLSBNW2ldKSAvIChuIC0gaSAtIDEpKTsKCWZvciAoaSA9IDE7IGkgPCBuIC0gMTsgaSsrKWlmIChteCA9PSAoZG91YmxlKShTW2ldIC0gTVtpXSkvKG4taS0xKSlwcmludGYoIiVkICIsIGkpOwoJcmV0dXJuIDA7Cn0=