#include <bits/stdc++.h>
using namespace std;
int Q, N;
int a[200005];
int coordx(int x) { return (x % N == 0) ? (x / N) : (x / N) + 1; }
int coordy(int x) { return (x % N == 0) ? N : x % N; }
int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cin >> Q;
  for (int i = 1; i <= Q; i++) cin >> a[i];
  bool ones = true;
  for (int i = 2; i <= Q; i++)
    if (abs(a[i] - a[i - 1]) != 1) {
      ones = false;
      N = abs(a[i] - a[i - 1]);
    }
  if (ones) {
    cout << "YES\n1000000000 1\n";
    return 0;
  }
  if (N == 0) {
    cout << "NO\n";
    return 0;
  }
  bool yes = true;
  int actx = coordx(a[1]);
  int acty = coordy(a[1]);
  for (int i = 2; i <= Q; i++) {
    int movx = coordx(a[i]);
    int movy = coordy(a[i]);
    if (abs(actx - movx) + abs(acty - movy) != 1) {
      yes = false;
      break;
    }
    actx = movx;
    acty = movy;
  }
  if (!yes)
    cout << "NO\n";
  else
    cout << "YES\n1000000000 " << N << "\n";
  return 0;
}
