Game with string

Two people are playing a game with a string s, consisting of lowercase latin letters.

On a player’s turn, he should choose two consecutive equal letters in the string and delete them.

For example, if the string is equal to “xaax” than there is only one possible turn: delete “aa”, so the string will become “xx”. A player not able to make a turn loses.

Your task is to determine which player will win if both play optimally.

Input

The only line contains the string s, consisting of lowercase latin letters (1≤|s|≤100000), where |s| means the length of a string s.

Output

If the first player wins, print “Yes”. If the second player wins, print “No”.

Examples

Input

abacaba

Output

No

Input

iiq

Output

Yes

Input

abba

Output

No

Note

In the first example the first player is unable to make a turn, so he loses.

In the second example first player turns the string into “q”, then second player is unable to move, so he loses.

代码：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<iomanip>
#include<cstring>
#include<string>
#include<cmath>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<map>
#define ll long long
#define mes(x,y) memset(x,y,sizeof(x))
ll gar(ll a,ll b){//最大公约数 
return b==0?a:gar(b,a%b);
}
using namespace std;
int main(){	
	string s;queue<char>que;stack<char>qq;int j=0;char si;cin>>s;
	for(int i=0;i<s.length();i++){
		que.push(s[i]);
	}
	ll len=s.length();
	for(int i=0;i<len;i++){
		if(!qq.empty()&&qq.top()==que.front()){
			j++;qq.pop();que.pop();
		}
		else{
			qq.push(que.front());
			que.pop();
		}
	}
	if(j%2==0) cout<<"No"<<endl;
	else cout<<"Yes"<<endl;
	return 0;
}