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| ≤ 100 000), 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.
import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;

public class B {
	
    static FastInput k = new FastInput(System.in);
    //static FastInput k = new FastInput("/home/rajkin/Desktop/input.txt");
	static FastOutput z = new FastOutput();
	
    public static void main(String[] args) throws Exception {
    	
    	while(k.hasNext()){
    		char [] y = k.next().toCharArray();
    		
    		ArrayDeque<Character> stack = new ArrayDeque<Character>();
    		int ans = 0;
    		
    		for(int i = 0; i<y.length; i++){
    			if(stack.isEmpty()){
    				stack.push(y[i]);
    			}
    			else{
    				if(y[i] == stack.peek()) {
    					stack.pop();
    					ans++;
    				}
    				else{
    					stack.push(y[i]);
    				}
    			}
    		}
    		
    		if(ans % 2 == 0){
    			z.println("No");
    		}
    		else{
    			z.println("Yes");
    		}
    	}
    	
    	z.flush();
    	System.exit(0);
    }
    
    static class FastInput {
        BufferedReader reader;
        StringTokenizer tokenizer;

        public FastInput(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream));
        }

        public FastInput(String path) {
            try {
                reader = new BufferedReader(new FileReader(path));
            } catch (FileNotFoundException e) {
                // TODO Auto-generated catch block
                e.printStackTrace();
            }
            tokenizer = null;
        }

        public String next() {
            return nextToken();
        }

        public String nextLine() {
            try {
                return reader.readLine();
            } catch (IOException e) {
                // TODO Auto-generated catch block
                e.printStackTrace();
            }

            return null;
        }

        public boolean hasNext() {
            try {
                return reader.ready();
            } catch (IOException e) {
                // TODO Auto-generated catch block
                e.printStackTrace();
            }
            return false;
        }

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

        public Integer nextInt() {
            return Integer.parseInt(nextToken());
        }

        public Long nextLong() {
            return Long.valueOf(nextToken());
        }

        public void inputIntegerList(ArrayList<Integer> list, int size) {
            for (int i = 0; i < size; i++) {
                list.add(nextInt());
            }
        }

        public void inputLongList(ArrayList<Long> list, int size) {
            for (int i = 0; i < size; i++) {
                list.add(nextLong());
            }
        }

        public void inputWordList(ArrayList<String> list, int size) {
            for (int i = 0; i < size; i++) {
                list.add(next());
            }
        }

        public void inputLineList(ArrayList<String> list, int size) {
            for (int i = 0; i < size; i++) {
                list.add(nextLine());
            }
        }

        public void inputIntegerArray(int[] array, int size) {
            for (int i = 0; i < size; i++) {
                array[i] = nextInt();
            }
        }

        public void inputLongArray(long[] array, int size) {
            for (int i = 0; i < size; i++) {
                array[i] = nextLong();
            }
        }

        public void inputWordArray(String[] array, int size) {
            for (int i = 0; i < size; i++) {
                array[i] = next();
            }
        }

        public void inputLineArray(String[] array, int size) {
            for (int i = 0; i < size; i++) {
                array[i] = nextLine();
            }
        }
    }

    static class FastOutput extends PrintWriter {
        public FastOutput() {
            super(new BufferedOutputStream(System.out));
        }
    }
}