#include <bits/stdc++.h>
using namespace std;
void solve() {
  vector<long long> v;
  long long n, m, j, y, i, k, x, l = 0, r = 0;
  cin >> n;
  long long a[n + 1];
  bool f = true;
  for (i = 0; i < n; i++) {
    cin >> a[i];
    if (a[i] != i + 1) f = false;
  }
  if (f) {
    cout << 0 << " " << 0 << endl;
    return;
  }
  x = 0;
  for (i = 0; i < n; i++) {
    if (a[i] != i + 1) {
      x = i;
      break;
    }
  }
  y = 0;
  for (i = n - 1; i >= 0; i--) {
    if (a[i] != i + 1) {
      y = i;
      break;
    }
  }
  if (x < y) {
    reverse(a + x, a + y + 1);
    f = true;
    for (i = 0; i < n; i++) {
      if (a[i] != i + 1) {
        f = false;
        break;
      }
    }
    if (f) {
      cout << x + 1 << " " << y + 1 << endl;
    } else
      cout << 0 << " " << 0 << endl;
  } else
    cout << 0 << " " << 0 << endl;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int T = 1;
  while (T--) solve();
  return 0;
}
