Minimum Binary Number CodeForces - 976A（水题）

A. Minimum Binary Number

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

String can be called correct if it consists of characters "0" and "1" and there are no redundant leading zeroes. Here are some examples: "0", "10", "1001".

You are given a correct string s.

You can perform two different operations on this string:

1. swap any pair of adjacent characters (for example, "101"  "110");
2. replace "11" with "1" (for example, "110"  "10").

Let val(s) be such a number that s is its binary representation.

Correct string a is less than some other correct string b iff val(a) < val(b).

Your task is to find the minimum correct string that you can obtain from the given one using the operations described above. You can use these operations any number of times in any order (or even use no operations at all).

Input

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

The second line contains the string s consisting of characters "0" and "1". It is guaranteed that the string s is correct.

Output

Print one string — the minimum correct string that you can obtain from the given one.

Examples

input

Copy

4
1001

output

Copy

100

input

Copy

1
1

output

Copy

1

Note

In the first example you can obtain the answer by the following sequence of operations: "1001"  "1010"  "1100"  "100".

In the second example you can't obtain smaller answer no matter what operations you use.

题意：给出一个无前导0的01串，有两种操作，① 将0和1的位置互换（不能有前导0） ②将两个连在一起的1变成一个1.求处经过若干次变换后使得这个串的字典序最小，并输出这个串。

思路：不管有多少个1，都可以变成一个1,所以，只要记录0的个数然后输出1000...0  就可以了。不管，需要特判串为  0 的情况

#include "iostream"
using namespace std;
int  main()
{
    int n,cnt=0;
    char ch[105];
    cin>>n>>ch;
    for(int i=0;i<n;i++)
        if(ch[i]=='0') cnt++;
    if(cnt!=n){
        cout<<"1";
        for(int i=0;i<cnt;i++) cout<<"0";
    }
    else
        cout<<"0";
    cout<<endl;
    return 0;
}