Little Vitaly loves different algorithms. Today he has invented a new algorithm just for you. Vitaly's algorithm works with string s, consisting of characters "x" and "y", and uses two following operations at runtime:

1. Find two consecutive characters in the string, such that the first of them equals "y", and the second one equals "x" and swap them. If there are several suitable pairs of characters, we choose the pair of characters that is located closer to the beginning of the string.
2. Find in the string two consecutive characters, such that the first of them equals "x" and the second one equals "y". Remove these characters from the string. If there are several suitable pairs of characters, we choose the pair of characters that is located closer to the beginning of the string.

The input for the new algorithm is string s, and the algorithm works as follows:

1. If you can apply at least one of the described operations to the string, go to step 2 of the algorithm. Otherwise, stop executing the algorithm and print the current string.
2. If you can apply operation 1, then apply it. Otherwise, apply operation 2. After you apply the operation, go to step 1 of the algorithm.

Now Vitaly wonders, what is going to be printed as the result of the algorithm's work, if the input receives string s.

Input

The first line contains a non-empty string s.

It is guaranteed that the string only consists of characters "x" and "y". It is guaranteed that the string consists of at most 106 characters. It is guaranteed that as the result of the algorithm's execution won't be an empty string.

Output

In the only line print the string that is printed as the result of the algorithm's work, if the input of the algorithm input receives string s.

Examples

input

x

output

x

input

yxyxy

Copy

y

input

xxxxxy

output

xxxx

題意就是 1如果y在x的前面就調換他們的順序；

               2如果x在y的前面就刪除這兩個元素

     注意：步驟1要一直進行到不能進行才執行步驟2；

思路：其實這是一個找規律的題目，不難發現，不論你xy的位置怎麼放，只要有x和y同時存在，最後一定會刪除一個x和一個y

AC程式碼：

#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;

int main()
{
	string s;
	int i,sy,sx;
	cin>>s;
	sx=sy=0;
	int len=s.length();
//	cout<<len<<endl;
	for(i=0;i<len;i++)
	{
		if(s[i]=='x') sx++;
		else 		  sy++;
	}
	int minn=min(sx,sy);
	 sx-=minn;
	 sy-=minn;
	if(sx>0)
	{
		for(i=1;i<=sx;i++)
		cout<<"x";
		cout<<endl;
	}
	else 
	{
		for(i=1;i<=sy;i++)
		cout<<"y";
		cout<<endl;
	}
	return 0;
 }