Problem: A necklace can be described as a string of links ('-') and pearls ('o'), with the last link or pearl connected to the first one.

<image>

You can remove a link or a pearl and insert it between two other existing links or pearls (or between a link and a pearl) on the necklace. This process can be repeated as many times as you like, but you can't throw away any parts.

Can you make the number of links between every two adjacent pearls equal? Two pearls are considered to be adjacent if there is no other pearl between them.

Note that the final necklace should remain as one circular part of the same length as the initial necklace.

Input

The only line of input contains a string s (3 ≤ |s| ≤ 100), representing the necklace, where a dash '-' represents a link and the lowercase English letter 'o' represents a pearl.

Output

Print "YES" if the links and pearls can be rejoined such that the number of links between adjacent pearls is equal. Otherwise print "NO".

You can print each letter in any case (upper or lower).

Examples

Input

<span class="tex-font-style-tt">-o-o--</span>

Output

YES

Input

<span class="tex-font-style-tt">-o---</span>


Output

YES

Input

<span class="tex-font-style-tt">-o---o-</span>


Output

NO

Input

ooo


Output

YES

Solution (in JAVA):

Solution:
						import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.InputMismatchException;
										public class Solution implements Runnable
										{
											static final long MAX = 1000000007L;
											static class InputReader
											{
												private InputStream stream;
												private byte[] buf = new byte[1024];
												private int curChar;
												private int numChars;
												private SpaceCharFilter filter;
												private BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
										 
												public InputReader(InputStream stream)
												{
													this.stream = stream;
												}
												
												public int read()
												{
													if (numChars==-1) 
														throw new InputMismatchException();
													
													if (curChar >= numChars)
													{
														curChar = 0;
														try 
														{
															numChars = stream.read(buf);
														}
														catch (IOException e)
														{
															throw new InputMismatchException();
														}
														
														if(numChars <= 0)				
															return -1;
													}
													return buf[curChar++];
												}
											 
												public String nextLine()
												{
													String str = "";
										            try
										            {
										                str = br.readLine();
										            }
										            catch (IOException e)
										            {
										                e.printStackTrace();
										            }
										            return str;
												}
												public int nextInt()
												{
													int c = read();
													
													while(isSpaceChar(c)) 
														c = read();
													
													int sgn = 1;
													
													if (c == '-') 
													{
														sgn = -1;
														c = read();
													}
													
													int res = 0;
													do 
													{
														if(c<'0'||c>'9') 
															throw new InputMismatchException();
														res *= 10;
														res += c - '0';
														c = read();
													}
													while (!isSpaceChar(c)); 
													
													return res * sgn;
												}
												
												public long nextLong() 
												{
													int c = read();
													while (isSpaceChar(c))
														c = read();
													int sgn = 1;
													if (c == '-') 
													{
														sgn = -1;
														c = read();
													}
													long res = 0;
													
													do 
													{
														if (c < '0' || c > '9')
															throw new InputMismatchException();
														res *= 10;
														res += c - '0';
														c = read();
													}
													while (!isSpaceChar(c));
														return res * sgn;
												}
												
												public double nextDouble() 
												{
													int c = read();
													while (isSpaceChar(c))
														c = read();
													int sgn = 1;
													if (c == '-') 
													{
														sgn = -1;
														c = read();
													}
													double res = 0;
													while (!isSpaceChar(c) && c != '.') 
													{
														if (c == 'e' || c == 'E')
															return res * Math.pow(10, nextInt());
														if (c < '0' || c > '9')
															throw new InputMismatchException();
														res *= 10;
														res += c - '0';
														c = read();
													}
													if (c == '.') 
													{
														c = read();
														double m = 1;
														while (!isSpaceChar(c)) 
														{
															if (c == 'e' || c == 'E')
																return res * Math.pow(10, nextInt());
															if (c < '0' || c > '9')
																throw new InputMismatchException();
															m /= 10;
															res += (c - '0') * m;
															c = read();
														}
													}
													return res * sgn;
												}
												
												public String readString() 
												{
													int c = read();
													while (isSpaceChar(c))
														c = read();
													StringBuilder res = new StringBuilder();
													do 
													{
														res.appendCodePoint(c);
														c = read();
													} 
													while (!isSpaceChar(c));
													
													return res.toString();
												}
											 
												public boolean isSpaceChar(int c) 
												{
													if (filter != null)
														return filter.isSpaceChar(c);
													return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
												}
											 
												public String next() 
												{
													return readString();
												}
												
												public interface SpaceCharFilter 
												{
													public boolean isSpaceChar(int ch);
												}
											}
										 	
											public static void main(String args[]) throws Exception
											{
												new Thread(null, new Solution(),"Solution",1<<26).start();
											}
												
											
											public void run() 
											{
												InputReader sc= new InputReader(System.in);
												PrintWriter w= new PrintWriter(System.out);
												String s = sc.next();
												int c1 = 0;
												int c2 = 0;
												char[] ch = s.toCharArray();
												for(int i = 0;i < s.length();i++){
													if(ch[i] == '-'){
														c1++;
													}else{
														c2++;
													}
												}
												if(c2 == 0){
													w.println("YES");
												}
												else if(c1 % c2 == 0){
													w.println("YES");
												}else{
													w.println("NO");
												}
												w.close();
											}
											
											static class Pair implements Comparable<Pair>{
												int a;
												long b;
												Pair(int a,long b){
													this.a  =a;
													this.b = b;
												}
												Pair(){}	
												public boolean equals(Object o)
												{
													Pair p = (Pair)o;
													return (p.a==this.a && p.b== this.b);
												}
												
												public int compareTo(Pair p){
													return Long.compare(this.a,p.a);
												}
												public int hashCode(){
												
													return new Integer(a).hashCode()*31 + new Long(b).hashCode()*17;
												}
											}
							}