#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline bool chkmin(T &a, const T &b) {
  return b < a ? a = b, 1 : 0;
}
template <typename T>
inline bool chkmax(T &a, const T &b) {
  return a < b ? a = b, 1 : 0;
}
const int oo = 0x3f3f3f3f;
const int maxn = 300100;
int n;
int a[maxn + 5];
int main() {
  scanf("%d", &n);
  long long cnt = 0;
  long long sum = 0;
  for (int i = (0), i_end_ = (n); i < i_end_; ++i) {
    scanf("%d", a + i);
    sum += a[i];
    cnt += (a[i] + (i & 1)) >> 1;
  }
  printf("%lld\n", min(cnt, sum - cnt));
  return 0;
}

### Prompt

Please formulate a cpp solution to the following problem:

You are given a Young diagram. 

Given diagram is a histogram with n columns of lengths a_1, a_2, …, a_n (a_1 ≥ a_2 ≥ … ≥ a_n ≥ 1).

<image> Young diagram for a=[3,2,2,2,1].

Your goal is to find the largest number of non-overlapping dominos that you can draw inside of this histogram, a domino is a 1 × 2 or 2 × 1 rectangle.

Input

The first line of input contain one integer n (1 ≤ n ≤ 300 000): the number of columns in the given histogram.

The next line of input contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 300 000, a_i ≥ a_{i+1}): the lengths of columns.

Output

Output one integer: the largest number of non-overlapping dominos that you can draw inside of the given Young diagram.

Example

Input


5
3 2 2 2 1


Output


4

Note

Some of the possible solutions for the example:

<image> <image>

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline bool chkmin(T &a, const T &b) {
  return b < a ? a = b, 1 : 0;
}
template <typename T>
inline bool chkmax(T &a, const T &b) {
  return a < b ? a = b, 1 : 0;
}
const int oo = 0x3f3f3f3f;
const int maxn = 300100;
int n;
int a[maxn + 5];
int main() {
  scanf("%d", &n);
  long long cnt = 0;
  long long sum = 0;
  for (int i = (0), i_end_ = (n); i < i_end_; ++i) {
    scanf("%d", a + i);
    sum += a[i];
    cnt += (a[i] + (i & 1)) >> 1;
  }
  printf("%lld\n", min(cnt, sum - cnt));
  return 0;
}

```