Problem: Graph constructive problems are back! This time the graph you are asked to build should match the following properties.

The graph is connected if and only if there exists a path between every pair of vertices.

The diameter (aka "longest shortest path") of a connected undirected graph is the maximum number of edges in the shortest path between any pair of its vertices.

The degree of a vertex is the number of edges incident to it.

Given a sequence of n integers a_1, a_2, ..., a_n construct a connected undirected graph of n vertices such that:

  * the graph contains no self-loops and no multiple edges; 
  * the degree d_i of the i-th vertex doesn't exceed a_i (i.e. d_i ≤ a_i); 
  * the diameter of the graph is maximum possible. 



Output the resulting graph or report that no solution exists.

Input

The first line contains a single integer n (3 ≤ n ≤ 500) — the number of vertices in the graph.

The second line contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ n - 1) — the upper limits to vertex degrees.

Output

Print "NO" if no graph can be constructed under the given conditions.

Otherwise print "YES" and the diameter of the resulting graph in the first line.

The second line should contain a single integer m — the number of edges in the resulting graph.

The i-th of the next m lines should contain two integers v_i, u_i (1 ≤ v_i, u_i ≤ n, v_i ≠ u_i) — the description of the i-th edge. The graph should contain no multiple edges — for each pair (x, y) you output, you should output no more pairs (x, y) or (y, x).

Examples

Input


3
2 2 2


Output


YES 2
2
1 2
2 3


Input


5
1 4 1 1 1


Output


YES 2
4
1 2
3 2
4 2
5 2


Input


3
1 1 1


Output


NO

Note

Here are the graphs for the first two example cases. Both have diameter of 2.

<image> d_1 = 1 ≤ a_1 = 2

d_2 = 2 ≤ a_2 = 2

d_3 = 1 ≤ a_3 = 2 

<image> d_1 = 1 ≤ a_1 = 1

d_2 = 4 ≤ a_2 = 4

d_3 = 1 ≤ a_3 = 1

d_4 = 1 ≤ a_4 = 1 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool read(T &x) {
  int c = getchar();
  int sgn = 1;
  while (~c && c<'0' | c> '9') {
    if (c == '-') sgn = -1;
    c = getchar();
  }
  for (x = 0; ~c && '0' <= c && c <= '9'; c = getchar()) x = x * 10 + c - '0';
  x *= sgn;
  return ~c;
}
const long long N = 100005;
const long long MOD = 1e9 + 7;
set<long long> v[N];
long long vis[N];
int main() {
  vector<long long> allone;
  vector<pair<long long, long long> > noone;
  long long n = ({
    long long a;
    read(a);
    a;
  });
  for (int i = 1; i <= n; i++) {
    long long x = ({
      long long a;
      read(a);
      a;
    });
    if (x == 1)
      allone.emplace_back(i);
    else
      noone.emplace_back(x, i);
  }
  sort(noone.begin(), noone.end());
  reverse(noone.begin(), noone.end());
  long long prev = -1;
  long long path = 0;
  for (auto it : noone) {
    long long c = it.first;
    long long node = it.second;
    if (prev == -1) {
      prev = node;
      while (allone.size() > 1) {
        if (c == 1) break;
        v[allone.back()].emplace(node);
        allone.pop_back();
        --c;
        path = 1;
      }
    } else {
      v[prev].emplace(node);
      --c;
      prev = node;
      ++path;
      while (allone.size() > 1) {
        if (c == 1) break;
        v[allone.back()].emplace(node);
        allone.pop_back();
        --c;
      }
    }
  }
  if (allone.size() && prev != -1)
    v[prev].emplace(allone.back()), ++path, allone.pop_back();
  vector<pair<long long, long long> > ans;
  for (long long i = 1; i <= n; ++i) {
    if (!v[i].size()) continue;
    vector<long long> temp;
    for (long long x : v[i]) {
      ans.emplace_back(x, i);
      temp.emplace_back(x);
    }
    for (long long y : temp) {
      if (v[y].find(i) != v[y].end()) v[y].erase(i);
    }
  }
  if (allone.size())
    puts("NO");
  else {
    cout << "YES" << ' ' << path << '\n';
    printf("%lld", (long long)ans.size()), printf("\n");
    for (auto it : ans) {
      printf("%lld", it.first), printf(" "), printf("%lld", it.second),
          printf("\n");
    }
  }
}