#include <bits/stdc++.h>
using namespace std;
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
const int INF = 1 << 29;
inline long long two(long long n) { return 1 << n; }
inline long long test(long long n, long long b) { return (n >> b) & 1; }
inline void setBit(long long &n, long long b) { n |= two(b); }
inline void unsetBit(long long &n, long long b) { n &= ~two(b); }
inline long long last_bit(long long n) { return n & (-n); }
inline long long ones(long long n) {
  int res = 0;
  while (n && ++res) n -= n & (-n);
  return res;
}
inline bool sortDown(long long x, long long y) { return x > y; }
template <class T>
void chmax(T &a, const T &b) {
  a = max(a, b);
}
template <class T>
void chmin(T &a, const T &b) {
  a = min(a, b);
}
bool wayToSort(long long i, long long j) { return i > j; }
bool sortinrev(const pair<long long, long long> &a,
               const pair<long long, long long> &b) {
  return (a.first > b.first);
}
bool sortbysec(const pair<long long, long long> &a,
               const pair<long long, long long> &b) {
  return (a.second < b.second);
}
bool sortbysecdesc(const pair<long long, long long> &a,
                   const pair<long long, long long> &b) {
  return a.second > b.second;
}
int main() {
  int n;
  cin >> n;
  string s;
  cin >> s;
  long long one = 0;
  long long w[100000];
  long long j = 0;
  for (long long i = 0; i < n; i++) {
    if (s[i] == '1') {
      one++;
    }
    if (s[i] == '0') {
      w[j] = one;
      j++;
      one = 0;
    }
    if (s[n - 1] == '1') {
      w[j] = one;
    }
  }
  for (long long i = 0; i < j + 1; i++) {
    cout << w[i];
  }
  cout << endl;
  return 0;
}

### Prompt

Develop a solution in CPP to the problem described below:

Polycarp has just invented a new binary protocol for data transmission. He is encoding positive integer decimal number to binary string using following algorithm:

  * Each digit is represented with number of '1' characters equal to the value of that digit (for 0 it is zero ones). 
  * Digits are written one by one in order corresponding to number and separated by single '0' character. 



Though Polycarp learnt how to encode the numbers, he has no idea how to decode them back. Help him calculate the decoded number.

Input

The first line contains one integer number n (1 ≤ n ≤ 89) — length of the string s.

The second line contains string s — sequence of '0' and '1' characters, number in its encoded format. It is guaranteed that the number corresponding to the string is positive and doesn't exceed 109. The string always starts with '1'.

Output

Print the decoded number.

Examples

Input

3
111


Output

3


Input

9
110011101


Output

2031

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
const int INF = 1 << 29;
inline long long two(long long n) { return 1 << n; }
inline long long test(long long n, long long b) { return (n >> b) & 1; }
inline void setBit(long long &n, long long b) { n |= two(b); }
inline void unsetBit(long long &n, long long b) { n &= ~two(b); }
inline long long last_bit(long long n) { return n & (-n); }
inline long long ones(long long n) {
  int res = 0;
  while (n && ++res) n -= n & (-n);
  return res;
}
inline bool sortDown(long long x, long long y) { return x > y; }
template <class T>
void chmax(T &a, const T &b) {
  a = max(a, b);
}
template <class T>
void chmin(T &a, const T &b) {
  a = min(a, b);
}
bool wayToSort(long long i, long long j) { return i > j; }
bool sortinrev(const pair<long long, long long> &a,
               const pair<long long, long long> &b) {
  return (a.first > b.first);
}
bool sortbysec(const pair<long long, long long> &a,
               const pair<long long, long long> &b) {
  return (a.second < b.second);
}
bool sortbysecdesc(const pair<long long, long long> &a,
                   const pair<long long, long long> &b) {
  return a.second > b.second;
}
int main() {
  int n;
  cin >> n;
  string s;
  cin >> s;
  long long one = 0;
  long long w[100000];
  long long j = 0;
  for (long long i = 0; i < n; i++) {
    if (s[i] == '1') {
      one++;
    }
    if (s[i] == '0') {
      w[j] = one;
      j++;
      one = 0;
    }
    if (s[n - 1] == '1') {
      w[j] = one;
    }
  }
  for (long long i = 0; i < j + 1; i++) {
    cout << w[i];
  }
  cout << endl;
  return 0;
}

```