Problem: 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

Solution (in JAVA):

Solution:
import java.io.*;
import java.lang.*;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.IOException;
import java.util.StringTokenizer;
import java.util.Random;
import java.util.Arrays;
import java.util.ArrayList;
import java.util.Collections;

public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Solution solver = new Solution();
        solver.solve(1, in, out);
        out.close();
    }
}

class Solution {
    
    public void solve(int testNumber, InputReader in, PrintWriter out) {
		int n = in.nextInt();
		String s = in.next();
		String ans = "";
		int count = 0;
		for(int i = 0; i<n; i++){
		    char c = s.charAt(i);
		    if(c=='0'){
		        ans += String.valueOf(count);
		        count = 0;
		    }
		    else{
		        count++;
		    }
		}
		ans += String.valueOf(count);
		out.println(ans);
    }
    private static long lcm(long a, long b){
	    return a * b / gcd(a,b);
	}
	private static long gcd(long a, long b){
	    if(b==0){
	        return a;
	    }
	    return gcd(b, a%b);
	}
	private static void shuffle(long[] a) {
        Random get = new Random();
        for (int i = 0; i < a.length; i++) {
            int r = get.nextInt(a.length);
            long temp = a[i];
            a[i] = a[r];
            a[r] = temp;
        }   
    }
}

class InputReader {
    public BufferedReader reader;
    public StringTokenizer tokenizer;

    public InputReader(InputStream stream) {
        reader = new BufferedReader(new InputStreamReader(stream), 32768);
        tokenizer = null;
    }

    public String next() {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }
    public long nextLong()
    {
        return Long.parseLong(next());
    }
    public double nextDouble()
    {
        return Double.parseDouble(next());
    }
    public String nextLine()
    {
        try
        {
            return reader.readLine();
        }
        catch(Exception e)
        {
            e.printStackTrace();
        }
        return null;
    }
    public boolean hasNext()
    {
        String next=null;
        try
        {
            next=reader.readLine();
        }
        catch(Exception e)
        {
        }
        if(next==null)
        {
            return false;
        }
        tokenizer=new StringTokenizer(next);
        return true;
    }
}