#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
const int M = 1e9 + 7;
bitset<N> bs;
int main() {
  long long n;
  cin >> n;
  long long sum = 0;
  int arr[n];
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
    sum += arr[i];
  }
  long long ans = 0;
  ans += (arr[0] / 2);
  int par = 0;
  for (int i = 1; i < n; i++) {
    if (arr[i] % 2 == (arr[i - 1]) % 2) par = par ^ 1;
    if (par)
      ans += (arr[i] + 1) / 2;
    else
      ans += (arr[i] / 2);
  }
  ans = min(ans, sum - ans);
  cout << ans;
}

### Prompt

Please create a solution in cpp 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;
const int N = 1e5 + 10;
const int M = 1e9 + 7;
bitset<N> bs;
int main() {
  long long n;
  cin >> n;
  long long sum = 0;
  int arr[n];
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
    sum += arr[i];
  }
  long long ans = 0;
  ans += (arr[0] / 2);
  int par = 0;
  for (int i = 1; i < n; i++) {
    if (arr[i] % 2 == (arr[i - 1]) % 2) par = par ^ 1;
    if (par)
      ans += (arr[i] + 1) / 2;
    else
      ans += (arr[i] / 2);
  }
  ans = min(ans, sum - ans);
  cout << ans;
}

```