When the curtains are opened, a canvas unfolds outside. Kanno marvels at all the blonde colours along the riverside — not tangerines, but blossoms instead.

"What a pity it's already late spring," sighs Mino with regret, "one more drizzling night and they'd be gone."

"But these blends are at their best, aren't they?" Absorbed in the landscape, Kanno remains optimistic. 

The landscape can be expressed as a row of consecutive cells, each of which either contains a flower of colour amber or buff or canary yellow, or is empty.

When a flower withers, it disappears from the cell that it originally belonged to, and it spreads petals of its colour in its two neighbouring cells (or outside the field if the cell is on the side of the landscape). In case petals fall outside the given cells, they simply become invisible.

You are to help Kanno determine whether it's possible that after some (possibly none or all) flowers shed their petals, at least one of the cells contains all three colours, considering both petals and flowers. Note that flowers can wither in arbitrary order.

Input

The first and only line of input contains a non-empty string s consisting of uppercase English letters 'A', 'B', 'C' and characters '.' (dots) only (\lvert s \rvert ≤ 100) — denoting cells containing an amber flower, a buff one, a canary yellow one, and no flowers, respectively.

Output

Output "Yes" if it's possible that all three colours appear in some cell, and "No" otherwise.

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

Examples

Input

.BAC.


Output

Yes


Input

AA..CB


Output

No

Note

In the first example, the buff and canary yellow flowers can leave their petals in the central cell, blending all three colours in it.

In the second example, it's impossible to satisfy the requirement because there is no way that amber and buff meet in any cell.


    import java.io.*;
    import java.lang.reflect.Array;
    import java.math.BigInteger;
    import java.util.*;
     
    public class Main {
     
    	private static InputStream stream;
    	private static byte[] buf = new byte[1024];
    	private static int curChar;
    	private static int numChars;
    	private static SpaceCharFilter filter;
    	private static PrintWriter pw;
    	public static final long mod = (long)1e9+7;
        public static void main(String[] args) {
        	InputReader(System.in);
    		pw = new PrintWriter(System.out); 
            new Thread(null ,new Runnable(){
               public void run(){
                   try{
                       test();//This is solution method
               pw.close();
           } catch(Exception e){
               e.printStackTrace();
           }
       }
    },"1",1<<26).start();
            }
        public static void test() throws IOException{
       
       	int t=1;
       	while(t-->0){
       	
       		solve();
       		//pw.println();
       		//sb.append("\n");	
       	}
       	//pw.println(sb);
       }
        static int st[];
        private static void solve(){

        	HashSet<Integer> prime = new HashSet<Integer>();
        	for(int i=2;i<=1;i++) {
        		if(isPrime(i)) {
        			prime.add(i);
        		}
        	}
        	String s=nextLine();
        	
        	
        	for(int i=1;i<s.length()-1;i++) {
        		if(s.charAt(i)!='.' && s.charAt(i-1)!='.' && s.charAt(i+1)!= '.' && s.charAt(i-1)!=s.charAt(i) && s.charAt(i+1)!=s.charAt(i) && s.charAt(i+1)!=s.charAt(i-1)) {
        			pw.println("Yes");
        			return;
        		}
        	}
        	pw.println("No");
        	
        	
     }
        private static boolean isPalindrome(int freq[]){
    		int odd=0;
    		for(int i=0;i<26;i++){
    			if(freq[i]%2!=0){
    				odd++;
    			}
    		}
    		if(odd==1)
    			return true;
    		return false;
    	}
    		
        public static boolean isPrime(long n) {
    		if (n <= 1)
    			return false;
    		if (n <= 3)
    			return true;
     
    		if (n % 2 == 0 || n % 3 == 0)
    			return false;
     
    		for (long i = 5; i * i <= n; i = i + 6)
    			if (n % i == 0 || n % (i + 2) == 0)
    				return false;
     
    		return true;
    	}
        public static boolean check(int x,int y,int n){
        	if(x>=0 && x<n && y>=0 && y<n)
        		return true;
        	return false;
        }
       
    private static void update(int node,int low,int high,int ind,int val){
        	 if(ind < low || ind > high){
                 return;
             }
    		
    		if(low==high){
         		st[node]=val;
         		return;
        	 }
        	 
        	int mid=(low+high)/2;
        	if(low<= ind && ind<=mid){
        		update(2*node, low, mid, ind, val);
        	}else{
        		update(2*node+1, mid+1, high, ind, val);
        	}
         st[node]= st[2*node] + st[2*node+1];
    }
        
    private static int query(int node,int low,int high,int qlow,int qhigh){
        	
        	if(qlow>high || qhigh<low){
        		return 0;
        	}
        	 
        	if(qlow<=low && qhigh>=high){
            	
        		return st[node];
        	}
        	
        int mid=(low+high)/2;
        int ans1=query(2*node, low, mid, qlow, qhigh);
        int ans2=query(2*node+1, mid+1, high, qlow, qhigh);
        
        return ans1 + ans2;
        }
        
        
     
     // To Get Input
     // Some Buffer Methods
      
         		     	
         		    	public static void InputReader(InputStream stream1) {
         		    		stream = stream1;
         		    	}
      
         		    	private static boolean isWhitespace(int c) {
         		    		return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
         		    	}
      
         		    	private static boolean isEndOfLine(int c) {
         		    		return c == '\n' || c == '\r' || c == -1;
         		    	}
      
         		    	private static 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++];
         		    	}
      
         		    	private static 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;
         		    	}
      
         		    	private static 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;
         		    	}
      
         		    	private static String nextToken() {
         		    		int c = read();
         		    		while (isSpaceChar(c))
         		    			c = read();
         		    		StringBuilder res = new StringBuilder();
         		    		do {
         		    			res.appendCodePoint(c);
         		    			c = read();
         		    		} while (!isSpaceChar(c));
         		    		return res.toString();
         		    	}
      
         		    	private static String nextLine() {
         		    		int c = read();
         		    		while (isSpaceChar(c))
         		    			c = read();
         		    		StringBuilder res = new StringBuilder();
         		    		do {
         		    			res.appendCodePoint(c);
         		    			c = read();
         		    		} while (!isEndOfLine(c));
         		    		return res.toString();
         		    	}
      
         		    	private static int[] nextIntArray(int n) {
         		    		int[] arr = new int[n];
         		    		for (int i = 0; i < n; i++) {
         		    			arr[i] = nextInt();
         		    		}
         		    		return arr;
         		    	}
      
         		    	private static long[][] next2dArray(int n, int m) {
         		    		long[][] arr = new long[n][m];
         		    		for (int i = 0; i < n; i++) {
         		    			for (int j = 0; j < m; j++) {
         		    				arr[i][j] = nextLong();
         		    			}
         		    		}
         		    		return arr;
         		    	}
         		    	private static char[][] nextCharArray(int n,int m){
         		    		char [][]c=new char[n][m];
         		    		for(int i=0;i<n;i++){
         		    			String s=nextLine();
         		    			for(int j=0;j<s.length();j++){
         		    				c[i][j]=s.charAt(j);
         		    			}
         		    		}
         		    		return c;
         		    	}
      
         		    	private static long[] nextLongArray(int n) {
         		    		long[] arr = new long[n];
         		    		for (int i = 0; i < n; i++) {
         		    			arr[i] = nextLong();
         		    		}
         		    		return arr;
         		    	}
      
         		    	private static void pArray(int[] arr) {
         		    		for (int i = 0; i < arr.length; i++) {
         		    			pw.print(arr[i] + " ");
         		    		}
         		    		pw.println();
         		    		return;
         		    	}
      
         		    	private static void pArray(long[] arr) {
         		    		for (int i = 0; i < arr.length; i++) {
         		    			pw.print(arr[i] + " ");
         		    		}
         		    		pw.println();
         		    		return;
         		    	}
      
         		    	private static void pArray(boolean[] arr) {
         		    		for (int i = 0; i < arr.length; i++) {
         		    			pw.print(arr[i] + " ");
         		    		}
         		    		pw.println();
         		    		return;
         		    	}
      
         		    	private static boolean isSpaceChar(int c) {
         		    		if (filter != null)
         		    			return filter.isSpaceChar(c);
         		    		return isWhitespace(c);
         		    	}
      
         		    	private interface SpaceCharFilter {
         		    		public boolean isSpaceChar(int ch);
         		    	}
        
    }
     
    /*class Pair implements Comparable<Pair>{
    long lit,pri;
     
    public Pair(long x,long y) {
     
    	this.lit=x;
    	this.pri=y;
    }
     
    @Override
    public int compareTo(Pair arg0) {
    	if((double)lit/(double)pri > (double)arg0.lit/(double)arg0.pri){
    		return 1;
    	}
    	if((double)lit/(double)pri < (double)arg0.lit/(double)arg0.pri){
    		return -1;
    	}
    	return 0;
    //	return 0;
    }
    }
    */

