#include int main() { int n, a[50], min, max, flag = 0, kame = 0, tsuru = 0, i; scanf("%d", &n); for (i = 0; i < n; i++) { scanf("%d", &a[i]); } for (i = 1; i < n; i++) { if (a[i - 1] < a[i]) { min = a[i - 1]; max = a[i]; flag = 1; break; } else if (a[i - 1] > a[i]) { max = a[i - 1]; min = a[i]; flag = 1; break; } } if (flag == 1) { for (i = 0; i < n; i++) { if (a[i] == min) kame++; else tsuru++; } } else { if (a[0] == 4 * (n - 1)) kame = n; else tsuru = n; } printf("%d %d\n", tsuru, kame); return 0; }