#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-ffloat-store")
#pragma GCC optimize("-fno-defer-pop")
long long int power(long long int a, long long int b, long long int m) {
  if (b == 0) return 1;
  if (b == 1) return a % m;
  long long int t = power(a, b / 2, m) % m;
  t = (t * t) % m;
  if (b & 1) t = ((t % m) * (a % m)) % m;
  return t;
}
long long int modInverse(long long int a, long long int m) {
  return power(a, m - 2, m);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int i, j, k, l, n;
  cin >> n;
  vector<long long int> a, b;
  for (i = 1; i <= n; i++) {
    cin >> k;
    a.push_back(k);
  }
  b = a;
  sort(b.begin(), b.end());
  if (a == b) {
    cout << "0 0\n";
    return 0;
  }
  long long int mni = 1e18, mxi = 0;
  for (i = 0; i < n; i++) {
    if (a[i] != b[i]) {
      mxi = max(mxi, i);
      mni = min(mni, i);
    }
  }
  reverse(a.begin() + mni, a.begin() + mxi + 1);
  if (a == b) {
    cout << mni + 1 << " " << mxi + 1 << "\n";
  } else {
    cout << "0 0";
  }
  return 0;
}
