Problem: A camera you have accidentally left in a desert has taken an interesting photo. The photo has a resolution of n pixels width, and each column of this photo is all white or all black. Thus, we can represent the photo as a sequence of n zeros and ones, where 0 means that the corresponding column is all white, and 1 means that the corresponding column is black.

You think that this photo can contain a zebra. In this case the whole photo should consist of several (possibly, only one) alternating black and white stripes of equal width. For example, the photo [0, 0, 0, 1, 1, 1, 0, 0, 0] can be a photo of zebra, while the photo [0, 0, 0, 1, 1, 1, 1] can not, because the width of the black stripe is 3, while the width of the white stripe is 4. Can the given photo be a photo of zebra or not?

Input

The first line contains a single integer n (1 ≤ n ≤ 100 000) — the width of the photo.

The second line contains a sequence of integers a1, a2, ..., an (0 ≤ ai ≤ 1) — the description of the photo. If ai is zero, the i-th column is all black. If ai is one, then the i-th column is all white.

Output

If the photo can be a photo of zebra, print "YES" (without quotes). Otherwise, print "NO".

You can print each letter in any case (upper or lower).

Examples

Input

9
0 0 0 1 1 1 0 0 0


Output

YES


Input

7
0 0 0 1 1 1 1


Output

NO


Input

5
1 1 1 1 1


Output

YES


Input

8
1 1 1 0 0 0 1 1


Output

NO


Input

9
1 1 0 1 1 0 1 1 0


Output

NO

Note

The first two examples are described in the statements.

In the third example all pixels are white, so the photo can be a photo of zebra.

In the fourth example the width of the first stripe is equal to three (white color), the width of the second stripe is equal to three (black), and the width of the third stripe is equal to two (white). Thus, not all stripes have equal length, so this photo is not a photo of zebra.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
long long mult(long long a, long long b, long long p = 1000000007) {
  return ((a % p) * (b % p)) % p;
}
long long add(long long a, long long b, long long p = 1000000007) {
  return (a % p + b % p) % p;
}
long long fpow(long long n, long long k, long long p = 1000000007) {
  long long r = 1;
  for (; k; k >>= 1LL) {
    if (k & 1LL) r = mult(r, n, p);
    n = mult(n, n, p);
  }
  return r;
}
long long inv(long long a, long long p = 1000000007) {
  return fpow(a, p - 2, p);
}
void self_max(int &a, int &b) { a = max(a, b); }
void self_min(int &a, int &b) { a = min(a, b); }
bool isPrime(int n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (int i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
const long long sizes = 1e7 + 1;
long long n, m, k, o, p;
int arr[300005];
int dp[40];
int inde[40];
long long sum;
void solve() {
  cin >> n;
  std::vector<int> v;
  std::vector<int> vec;
  cin >> o;
  v.push_back(o);
  long long flag = 0;
  long long cur = v[0];
  long long count = 1;
  for (int i = 1; i < n; ++i) {
    cin >> o;
    v.push_back(o);
    if (o == cur) {
      count++;
    } else {
      cur = o;
      vec.push_back(count);
      count = 1;
    }
  }
  vec.push_back(count);
  long long val = vec[0];
  for (int i = 0; i < vec.size(); ++i) {
    if (vec[i] != val) {
      flag = 1;
      break;
    }
  }
  if (flag)
    cout << "NO" << '\n';
  else
    cout << "YES" << '\n';
}
int main() {
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(12);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  int p = t;
  while (t--) {
    solve();
  }
}