Problem: Mad scientist Mike has just finished constructing a new device to search for extraterrestrial intelligence! He was in such a hurry to launch it for the first time that he plugged in the power wires without giving it a proper glance and started experimenting right away. After a while Mike observed that the wires ended up entangled and now have to be untangled again.

The device is powered by two wires "plus" and "minus". The wires run along the floor from the wall (on the left) to the device (on the right). Both the wall and the device have two contacts in them on the same level, into which the wires are plugged in some order. The wires are considered entangled if there are one or more places where one wire runs above the other one. For example, the picture below has four such places (top view):

<image>

Mike knows the sequence in which the wires run above each other. Mike also noticed that on the left side, the "plus" wire is always plugged into the top contact (as seen on the picture). He would like to untangle the wires without unplugging them and without moving the device. Determine if it is possible to do that. A wire can be freely moved and stretched on the floor, but cannot be cut.

To understand the problem better please read the notes to the test samples.

Input

The single line of the input contains a sequence of characters "+" and "-" of length n (1 ≤ n ≤ 100000). The i-th (1 ≤ i ≤ n) position of the sequence contains the character "+", if on the i-th step from the wall the "plus" wire runs above the "minus" wire, and the character "-" otherwise.

Output

Print either "Yes" (without the quotes) if the wires can be untangled or "No" (without the quotes) if the wires cannot be untangled.

Examples

Input

-++-


Output

Yes


Input

+-


Output

No


Input

++


Output

Yes


Input

-


Output

No

Note

The first testcase corresponds to the picture in the statement. To untangle the wires, one can first move the "plus" wire lower, thus eliminating the two crosses in the middle, and then draw it under the "minus" wire, eliminating also the remaining two crosses.

In the second testcase the "plus" wire makes one full revolution around the "minus" wire. Thus the wires cannot be untangled: 

<image>

In the third testcase the "plus" wire simply runs above the "minus" wire twice in sequence. The wires can be untangled by lifting "plus" and moving it higher: 

<image>

In the fourth testcase the "minus" wire runs above the "plus" wire once. The wires cannot be untangled without moving the device itself: 

<image>

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;
import java.util.stream.*;

public class ACM {
    public static void main(String args[]) throws FileNotFoundException, IOException {
        Scanner x = new Scanner(System.in);
        String s=x.next();
        StackDynamicArray <Character> sd=new StackDynamicArray<Character>();
       for (int i = 0; i < s.length(); i++) {
            if(sd.isEmpty())sd.push(s.charAt(i));
            else if(sd.topp().equals(s.charAt(i))) sd.pop();
            else sd.push(s.charAt(i));
        }
        //sd.FixSize();
       if(sd.isEmpty()) System.out.println("YES");
       else System.out.println("NO");

    }

    public static class StackDynamicArray<T> {
        int top=-1;
        Object [] StackDynamicArray;
        int count=0;
        int size=1;
        public StackDynamicArray() {
            StackDynamicArray = new Object[1];
        }
        public void push(Object element){
            if(!isFull()){
                ensureCapacity(size+1);
                top++;
                size++;
                StackDynamicArray[top]=element;
            }
            else
                System.out.println("Stack is Full");
        }
        public T pop(){
            T item=(T) StackDynamicArray[top];
            top--;
            size--;
            //ensureCapacitypop(size);
            return item;
        }
        public void FixSize(){
            ensureCapacitypop(size);
        }
        public boolean isFull(){
            if(top==size-1) return true;
            else return false;
        }
        public boolean isEmpty(){
            if(top==-1) return true;
            else return false;
        }
        public void Print(){
            for (int i = 0; i <StackDynamicArray.length ; i++) {
                if(top!=-1) {
                    T item = (T) StackDynamicArray[top];
                    top--;
                    System.out.println(item);
                }
                else
                    break;
            }
        }
        public T topp(){
            T item = (T) StackDynamicArray[top];
            return item;
        }
        public void ensureCapacity(int MinCapacity){
            int OldCapacity=StackDynamicArray.length;
            if(MinCapacity>OldCapacity){
                int NewCapacity=OldCapacity*2;
                StackDynamicArray= Arrays.copyOf(StackDynamicArray,NewCapacity);
            }
        }
        public void ensureCapacitypop(int MinCapacity){
            int MaxCapacity=StackDynamicArray.length;
            while(top<MaxCapacity){
                StackDynamicArray= Arrays.copyOf(StackDynamicArray,MaxCapacity/2);
                MaxCapacity=StackDynamicArray.length;
            }
        }
        public int ArraySize(){
            return StackDynamicArray.length;
        }

    }

}