Three companies decided to order a billboard with pictures of their logos. A billboard is a big square board. A logo of each company is a rectangle of a non-zero area. 

Advertisers will put up the ad only if it is possible to place all three logos on the billboard so that they do not overlap and the billboard has no empty space left. When you put a logo on the billboard, you should rotate it so that the sides were parallel to the sides of the billboard.

Your task is to determine if it is possible to put the logos of all the three companies on some square billboard without breaking any of the described rules.

Input

The first line of the input contains six positive integers x1, y1, x2, y2, x3, y3 (1 ≤ x1, y1, x2, y2, x3, y3 ≤ 100), where xi and yi determine the length and width of the logo of the i-th company respectively.

Output

If it is impossible to place all the three logos on a square shield, print a single integer "-1" (without the quotes).

If it is possible, print in the first line the length of a side of square n, where you can place all the three logos. Each of the next n lines should contain n uppercase English letters "A", "B" or "C". The sets of the same letters should form solid rectangles, provided that:

  * the sizes of the rectangle composed from letters "A" should be equal to the sizes of the logo of the first company, 
  * the sizes of the rectangle composed from letters "B" should be equal to the sizes of the logo of the second company, 
  * the sizes of the rectangle composed from letters "C" should be equal to the sizes of the logo of the third company, 



Note that the logos of the companies can be rotated for printing on the billboard. The billboard mustn't have any empty space. If a square billboard can be filled with the logos in multiple ways, you are allowed to print any of them.

See the samples to better understand the statement.

Examples

Input

5 1 2 5 5 2


Output

5
AAAAA
BBBBB
BBBBB
CCCCC
CCCCC


Input

4 4 2 6 4 2


Output

6
BBBBBB
BBBBBB
AAAACC
AAAACC
AAAACC
AAAACC
import java.util.*;

import java.io.*;
import java.math.*;

/**
 * @author Naitik
 * 
 */
public class B

{ 
	 static FastReader sc=new FastReader();
	 static long dp[][];
	 static int mod=1000000007;
	 static int max;
	 static long bit[];
	 static int in[];
	 static int ot[];
	 static int timer=1;
	 static HashMap<Integer,Integer> map;
		  public static void main(String[] args) 
    {
			//CHECK FOR N=1
		       	//CHECK FOR N=1
		  PrintWriter out=new PrintWriter(System.out);
		 // StringBuffer sb=new StringBuffer("");
		  int ttt=1;
		  //  ttt =i(); 
	        while (ttt-- > 0) 
			{
	        	int A[]=input(6);
	        	ArrayList<ArrayList<Pair>> l=new ArrayList<ArrayList<Pair>>();
                ArrayList<Pair> p=new ArrayList<B.Pair>();
	        	go(A, 0, l, p);
//	        	for(int i=0;i<l.size();i++) {
//	        		for(Pair P : l.get(i)) {
//	        			System.out.println(P.x+" "+P.y);
//	        		}
//	        	}
	        	for(int ii=0;ii<l.size();ii++) {
	        		int B[][]=go(l.get(ii));
	        		if(B!=null) {
	        			System.out.println(B.length);
	        			for(int i=0;i<B.length;i++) {
	        				for(int j=0;j<B.length;j++) {
	        					if(B[i][j]==1)
	        					out.print('A');
	        					else if(B[i][j]==2)
	        						out.print('B');
	        					else
	        						out.print('C');
	        				}
	        				out.println();
	        			}
	        			out.flush();
	        			return;
	        		}
	        	}
	        	System.out.println("-1");
	        	

	   		 
	        	
			}
		  out.close();
	        	//System.out.println(sb.toString());
		    
		    //CHECK FOR N=1                    //CHECK FOR M=0
	        //CHECK FOR N=1                    //CHECK FOR M=0
	       	
    }
		  static int[][] go(ArrayList<Pair> l) {
			  for(int i=0;i<3;i++) {
				  for(int j=0;j<3;j++) {
					  for(int k=0;k<3;k++) {
						  if(i==j || i==k || j==k)
							  continue;
						  int A[][]=go(l.get(i), l.get(j), l.get(k));
						  if(A!=null)
							  return A;
					  }
				  }
			  }
			  return null;
		  }
		  static int[][] go(Pair p,Pair q,Pair r){
			  int a=p.x;
			  int b=p.y;
			  int c=q.x;
			  int d=q.y;
			  if(a==c && b!=d) {
				  int row=a+c;
				  int a1=-1,b1=-1;
				  if(row==max(b,d)) {
					  if(b<d) {
						  a1=a;
						  b1=d-b;
					  }
					  else {
						  a1=c;
						  b1=b-d;
					  }
					  if(a1==r.x && b1==r.y) {
						  int A[][]=new int[a+c][a+c];
						  for(int i=0;i<a;i++) {
							  for(int j=0;j<b;j++) {
								  A[i][j]=1;
							  }
						  }
						  for(int i=a;i<a+c;i++) {
							  for(int j=0;j<d;j++) {
								  A[i][j]=2;
							  }
						  }
						  for(int i=0;i<A.length;i++) {
							  for(int j=0;j<A.length;j++) {
								  if(A[i][j]==0) {
									  A[i][j]=3;
								  }
							  }
						  }
						  return A;
						  
					  }
				  }
				  if(b+d>a) {
				  b1=b+d;
				  a1=b+d-a;
				  }
				  else {
					  a1=a;
					  b1=a-(b+d);
				  }
				  if(a1==r.x && b1==r.y) {
					  int A[][]=new int[max(a,b+d)][max(a,b+d)];
					  for(int i=0;i<a;i++) {
						  for(int j=0;j<b;j++) {
							  A[i][j]=1;
						  }
					  }
					  for(int i=0;i<c;i++) {
						  for(int j=b;j<b+d;j++) {
							  A[i][j]=2;
						  }
					  }
					  for(int i=0;i<A.length;i++) {
						  for(int j=0;j<A.length;j++) {
							  if(A[i][j]==0) {
								  A[i][j]=3;
							  }
						  }
					  }
					  return A;
					  
				  }
				  
			  }
			  else if(a!=c && b==d) {
				  int a1=-1;
				  int b1=-1;
				  int col=b+d;
				  if(col==max(a,c)) {
					  if(a<c) {
						  b1=b;
						  a1=c-a;
					  }
					  else {
						  a1=a-c;
						  b1=d;
					  }
					  if(a1==r.x && b1==r.y) {
						  int A[][]=new int[b+d][b+d];
						  for(int i=0;i<a;i++) {
							  for(int j=0;j<b;j++) {
								  A[i][j]=1;
							  }
						  }
						  for(int i=0;i<c;i++) {
							  for(int j=b;j<b+d;j++) {
								  A[i][j]=2;
							  }
						  }
						  for(int i=0;i<A.length;i++) {
							  for(int j=0;j<A.length;j++) {
								  if(A[i][j]==0) {
									  A[i][j]=3;
								  }
							  }
						  }
						  return A;
						  
					  }
				  }
				  if(a+c<b) {
				  a1=b-(a+c);
				  b1=b;
				  }
				  else {
					  a1=a+c;
					  b1=a+c-b;
				  }
				  if(a1==r.x && b1==r.y) {
					  int A[][]=new int[max(b,a+c)][max(b,a+c)];
					  for(int i=0;i<a;i++) {
						  for(int j=0;j<b;j++) {
							  A[i][j]=1;
						  }
					  }
					  for(int i=a;i<a+c;i++) {
						  for(int j=0;j<d;j++) {
							  A[i][j]=2;
						  }
					  }
					  for(int i=0;i<A.length;i++) {
						  for(int j=0;j<A.length;j++) {
							  if(A[i][j]==0) {
								  A[i][j]=3;
							  }
						  }
					  }
					  return A;
					  
				  }
				  
			  }
			  else if(a==c && b==d) {
				  int a1=-1;
				  int b1=-1;
				  if(a+c<b) {
					  a1=b-(a+c);
					  b1=b;
					  }
					  else {
						  a1=a+c;
						  b1=a+c-b;
					  }
				  if(a1==r.x && b1==r.y) {
					  int A[][]=new int[max(b,a+c)][max(b,a+c)];
					  for(int i=0;i<a;i++) {
						  for(int j=0;j<b;j++) {
							  A[i][j]=1;
						  }
					  }
					  for(int i=a;i<a+c;i++) {
						  for(int j=0;j<d;j++) {
							  A[i][j]=2;
						  }
					  }
					  for(int i=0;i<A.length;i++) {
						  for(int j=0;j<A.length;j++) {
							  if(A[i][j]==0) {
								  A[i][j]=3;
							  }
						  }
					  }
					  return A;
					  
				  }
				  if(b+d>a) {
					  b1=b+d;
					  a1=b+d-a;
					  }
					  else {
						  a1=a;
						  b1=a-(b+d);
					  }
				  if(a1==r.x && b1==r.y) {
					  int A[][]=new int[max(a,b+d)][max(a,b+d)];
					  for(int i=0;i<a;i++) {
						  for(int j=0;j<b;j++) {
							  A[i][j]=1;
						  }
					  }
					  for(int i=0;i<c;i++) {
						  for(int j=b;j<b+d;j++) {
							  A[i][j]=2;
						  }
					  }
					  for(int i=0;i<A.length;i++) {
						  for(int j=0;j<A.length;j++) {
							  if(A[i][j]==0) {
								  A[i][j]=3;
							  }
						  }
					  }
					  return A;
					  
				  }
			  }
			  else  if(a!=c && b!=d) {
			  int row=a+c;
			  int a1=-1,b1=-1;
			  if(row==max(b,d)) {
				  if(b<d) {
					  a1=a;
					  b1=d-b;
				  }
				  else {
					  a1=c;
					  b1=b-d;
				  }
				  if(a1==r.x && b1==r.y) {
					  int A[][]=new int[a+c][a+c];
					  for(int i=0;i<a;i++) {
						  for(int j=0;j<b;j++) {
							  A[i][j]=1;
						  }
					  }
					  for(int i=a;i<a+c;i++) {
						  for(int j=0;j<d;j++) {
							  A[i][j]=2;
						  }
					  }
					  for(int i=0;i<A.length;i++) {
						  for(int j=0;j<A.length;j++) {
							  if(A[i][j]==0) {
								  A[i][j]=3;
							  }
						  }
					  }
					  return A;
					  
				  }
			  }
			  int col=b+d;
			  if(col==max(a,c)) {
				  if(a<c) {
					  b1=b;
					  a1=c-a;
				  }
				  else {
					  a1=a-c;
					  b1=d;
				  }
				  if(a1==r.x && b1==r.y) {
					  int A[][]=new int[b+d][b+d];
					  for(int i=0;i<a;i++) {
						  for(int j=0;j<b;j++) {
							  A[i][j]=1;
						  }
					  }
					  for(int i=0;i<c;i++) {
						  for(int j=b;j<b+d;j++) {
							  A[i][j]=2;
						  }
					  }
					  for(int i=0;i<A.length;i++) {
						  for(int j=0;j<A.length;j++) {
							  if(A[i][j]==0) {
								  A[i][j]=3;
							  }
						  }
					  }
					  return A;
					  
				  }
			  }
			  }
			  
			  
			  
			  
			  return null;
			
		  }
		  
		  
		  static void go(int A[],int i,ArrayList<ArrayList<Pair>> l,ArrayList<Pair> p) {
			  if(i>5) {
				  ArrayList<Pair> n=new ArrayList<B.Pair>();
				  for(Pair P : p) {
					  Pair pp=new Pair(P.x,P.y);
					  n.add(pp);
				  }
				  l.add(n);
				  return;
			  }
			  Pair P=new Pair(A[i], A[i+1]);
			  p.add(P);
			  go(A, i+2, l, p);
			  p.remove(p.size()-1);
			  P=new Pair(A[i+1],A[i]);
			  p.add(P);
			  go(A, i+2, l, p);
			  p.remove(p.size()-1);
		  }
		 
			
		  
		  



static class Pair implements Comparable<Pair>
     {
    	 int x;
    	 int y;
    	 Pair(int x,int y){
    		 this.x=x;
    		 this.y=y;
    		 
    	 }
		@Override
		public int compareTo(Pair o) {
			if(this.x>o.x)
				return 1;
			else if(this.x<o.x)
				return -1;
			else {
				if(this.y>o.y)
					return 1;
				else if(this.y<o.y)
					return -1;
				else
					return 0;
			}
		}
		
		/* FOR TREE MAP PAIR USE */
		
//		public int compareTo(Pair o) {
// 			if (x > o.x) {
// 				return 1;
// 			}
// 			if (x < o.x) {
// 				return -1;
// 			}
// 			if (y > o.y) {
// 				return 1;
// 			}
// 			if (y < o.y) {
// 				return -1;
// 			}
// 			return 0;
// 		}
//		public int hashCode() 
//		{ 
//			final int temp = 14; 
//			int ans = 1; 
//			ans =x*31+y*13; 
//			return ans; 
//		} 
  
		// Equal objects must produce the same 
		// hash code as long as they are equal 
		@Override
		public boolean equals(Object o) 
		{ 
			if (this == o) { 
				return true; 
			} 
			if (o == null) { 
				return false; 
			} 
			if (this.getClass() != o.getClass()) { 
				return false; 
			} 
			Pair other = (Pair)o; 
			if (this.x != other.x || this.y!=other.y) { 
				return false; 
			} 
			return true; 
		} 	
		
     }
//FRENWICK TREE
static void update(int i, int x){
	for(; i < bit.length; i += (i&-i))
		bit[i] += x;
}

static int sum(int i){
	int ans = 0;
	for(; i > 0; i -= (i&-i))
		ans += bit[i];
	return ans;
}
//END
static void add(int v) {
	if(!map.containsKey(v)) {
		map.put(v, 1);
	}
	else {
		map.put(v, map.get(v)+1);
	}
}
static void remove(int v) {
	if(map.containsKey(v)) {
		map.put(v, map.get(v)-1);
		if(map.get(v)==0)
			map.remove(v);
	}
}
static int[] copy(int A[]) {
	int B[]=new int[A.length];
	for(int i=0;i<A.length;i++) {
		B[i]=A[i];
	}
	return B;
}
static long[] copy(long A[]) {
	long B[]=new long[A.length];
	for(int i=0;i<A.length;i++) {
		B[i]=A[i];
	}
	return B;
}
static int[] input(int n) {
	int A[]=new int[n];
	   for(int i=0;i<n;i++) {
		   A[i]=sc.nextInt();
	   }
	   return A;
   }
static long[] inputL(int n) {
	long A[]=new long[n];
	   for(int i=0;i<n;i++) {
		   A[i]=sc.nextLong();
	   }
	   return A;
   }
static String[] inputS(int n) {
	String A[]=new String[n];
	   for(int i=0;i<n;i++) {
		   A[i]=sc.next();
	   }
	   return A;
   }
static long sum(int A[]) {
	long sum=0;
	for(int i : A) {
		sum+=i;
	}
	return sum;
}
static long sum(long A[]) {
	long sum=0;
	for(long i : A) {
		sum+=i;
	}
	return sum;
}
static void reverse(long A[]) {
	int n=A.length;
	long B[]=new long[n];
	for(int i=0;i<n;i++) {
		B[i]=A[n-i-1];
	}
	for(int i=0;i<n;i++)
		A[i]=B[i];
	
}
static void reverse(int A[]) {
	int n=A.length;
	int B[]=new int[n];
	for(int i=0;i<n;i++) {
		B[i]=A[n-i-1];
	}
	for(int i=0;i<n;i++)
		A[i]=B[i];
	
}
static void input(int A[],int B[]) {
	   for(int i=0;i<A.length;i++) {
		   A[i]=sc.nextInt();
		   B[i]=sc.nextInt();
	   }
}
static int[][] input(int n,int m){
	int A[][]=new int[n][m];
	for(int i=0;i<n;i++) {
		for(int j=0;j<m;j++) {
			A[i][j]=i();
		}
	}
	return A;
}
static char[][] charinput(int n,int m){
	char A[][]=new char[n][m];
	for(int i=0;i<n;i++) {
		String s=s();
		for(int j=0;j<m;j++) {
			A[i][j]=s.charAt(j);
		}
	}
	return A;
}
static int find(int A[],int a) {
	  if(A[a]==a)
		  return a;
	  return A[a]=find(A, A[a]);
}
static int max(int A[]) {
	int max=Integer.MIN_VALUE;
	for(int i=0;i<A.length;i++) {
		max=Math.max(max, A[i]);
	}
	return max;
}
static int min(int A[]) {
	int min=Integer.MAX_VALUE;
	for(int i=0;i<A.length;i++) {
		min=Math.min(min, A[i]);
	}
	return min;
}
static long max(long A[]) {
	long max=Long.MIN_VALUE;
	for(int i=0;i<A.length;i++) {
		max=Math.max(max, A[i]);
	}
	return max;
}
static long min(long A[]) {
	long min=Long.MAX_VALUE;
	for(int i=0;i<A.length;i++) {
		min=Math.min(min, A[i]);
	}
	return min;
}
static long [] prefix(long A[]) {
	long p[]=new long[A.length];
	p[0]=A[0];
	for(int i=1;i<A.length;i++)
		p[i]=p[i-1]+A[i];
	return p;
}
static long [] prefix(int A[]) {
	long p[]=new long[A.length];
	p[0]=A[0];
	for(int i=1;i<A.length;i++)
		p[i]=p[i-1]+A[i];
	return p;
}
static long [] suffix(long A[]) {
	long p[]=new long[A.length];
	p[A.length-1]=A[A.length-1];
	for(int i=A.length-2;i>=0;i--)
		p[i]=p[i+1]+A[i];
	return p;
}
static long [] suffix(int A[]) {
	long p[]=new long[A.length];
	p[A.length-1]=A[A.length-1];
	for(int i=A.length-2;i>=0;i--)
		p[i]=p[i+1]+A[i];
	return p;
}
static void fill(int dp[]) {
	Arrays.fill(dp, -1);
}
static void fill(int dp[][]) {
	for(int i=0;i<dp.length;i++)
	Arrays.fill(dp[i], -1);
}
static void fill(int dp[][][]) {
	for(int i=0;i<dp.length;i++) {
		for(int j=0;j<dp[0].length;j++) {
			Arrays.fill(dp[i][j],-1);
		}
	}
}
static void fill(int dp[][][][]) {
	for(int i=0;i<dp.length;i++) {
		for(int j=0;j<dp[0].length;j++) {
			for(int k=0;k<dp[0][0].length;k++) {
			Arrays.fill(dp[i][j][k],-1);
			}
		}
	}
}
static void fill(long dp[]) {
	Arrays.fill(dp, -1);
}
static void fill(long dp[][]) {
	for(int i=0;i<dp.length;i++)
	Arrays.fill(dp[i], -1);
}
static void fill(long dp[][][]) {
	for(int i=0;i<dp.length;i++) {
		for(int j=0;j<dp[0].length;j++) {
			Arrays.fill(dp[i][j],-1);
		}
	}
}
static void fill(long dp[][][][]) {
	for(int i=0;i<dp.length;i++) {
		for(int j=0;j<dp[0].length;j++) {
			for(int k=0;k<dp[0][0].length;k++) {
			Arrays.fill(dp[i][j][k],-1);
			}
		}
	}
}
static int min(int a,int b) {
	return Math.min(a, b);
}
static int min(int a,int b,int c) {
	return Math.min(a, Math.min(b, c));
}
static int min(int a,int b,int c,int d) {
	return Math.min(a, Math.min(b, Math.min(c, d)));
}
static int max(int a,int b) {
	return Math.max(a, b);
}
static int max(int a,int b,int c) {
	return Math.max(a, Math.max(b, c));
}
static int max(int a,int b,int c,int d) {
	return Math.max(a, Math.max(b, Math.max(c, d)));
}
static long min(long a,long b) {
	return Math.min(a, b);
}
static long min(long a,long b,long c) {
	return Math.min(a, Math.min(b, c));
}
static long min(long a,long b,long c,long d) {
	return Math.min(a, Math.min(b, Math.min(c, d)));
}
static long max(long a,long b) {
	return Math.max(a, b);
}
static long max(long a,long b,long c) {
	return Math.max(a, Math.max(b, c));
}
static long max(long a,long b,long c,long d) {
	return Math.max(a, Math.max(b, Math.max(c, d)));
}

static long power(long x, long y, long p)
{

	if(y==0)
		return 1;
	if(x==0)
		return 0;
    long res = 1;
    x = x % p;

    while (y > 0) {

        if (y % 2 == 1)
            res = (res * x) % p;

        y = y >> 1; 
        x = (x * x) % p;
    }

    return res;
}
static void print(int A[]) {
	for(int i : A) {
		System.out.print(i+" ");
	}
	System.out.println();
}
static void print(long A[]) {
	for(long i : A) {
		System.out.print(i+" ");
	}
	System.out.println();
}
static long mod(long x) {
	  return ((x%mod + mod)%mod);
}
static String reverse(String s) {
	StringBuffer p=new StringBuffer(s);
	p.reverse();
	return p.toString();
}

     static int i() {
    	 return sc.nextInt();
     }
     static String s() {
    	 return sc.next();
     }
     static long l() {
    	 return sc.nextLong();
     }  
     static void sort(int[] A){
        int n = A.length;
        Random rnd = new Random();
        for(int i=0; i<n; ++i){
            int tmp = A[i];
            int randomPos = i + rnd.nextInt(n-i);
            A[i] = A[randomPos];
            A[randomPos] = tmp;
        }
        Arrays.sort(A);
     }
     static void sort(long[] A){
	        int n = A.length;
	        Random rnd = new Random();
	        for(int i=0; i<n; ++i){
	            long tmp = A[i];
	            int randomPos = i + rnd.nextInt(n-i);
	            A[i] = A[randomPos];
	            A[randomPos] = tmp;
	        }
	        Arrays.sort(A);
	     }
  static String sort(String s) {
 	 Character ch[]=new Character[s.length()];
 	 for(int i=0;i<s.length();i++) {
 		 ch[i]=s.charAt(i);
 	 }
 	 Arrays.sort(ch);
 	 StringBuffer st=new StringBuffer("");
 	 for(int i=0;i<s.length();i++) {
 		 st.append(ch[i]);
 	 }
 	 return st.toString();
  }
  static HashMap<Integer,Integer> hash(int A[]){
	  HashMap<Integer,Integer> map=new HashMap<Integer, Integer>();
	  for(int i : A) {
		  if(map.containsKey(i)) {
			  map.put(i, map.get(i)+1);
		  }
		  else {
			  map.put(i, 1);
		  }
	  }
	  return map;
  }
  static TreeMap<Integer,Integer> tree(int A[]){
	  TreeMap<Integer,Integer> map=new TreeMap<Integer, Integer>();
	  for(int i : A) {
		  if(map.containsKey(i)) {
			  map.put(i, map.get(i)+1);
		  }
		  else {
			  map.put(i, 1);
		  }
	  }
	  return map;
  }
     static boolean prime(int n) 
	    { 
	        if (n <= 1) 
	            return false; 
	        if (n <= 3) 
	            return true; 
	        if (n % 2 == 0 || n % 3 == 0) 
	            return false; 
	        double sq=Math.sqrt(n);
	  
	        for (int i = 5; i <= sq; i = i + 6) 
	            if (n % i == 0 || n % (i + 2) == 0) 
	                return false; 
	        return true; 
	    } 
     static boolean prime(long n) 
	    { 
	        if (n <= 1) 
	            return false; 
	        if (n <= 3) 
	            return true; 
	        if (n % 2 == 0 || n % 3 == 0) 
	            return false; 
	        double sq=Math.sqrt(n);
	  
	        for (int i = 5; i <= sq; i = i + 6) 
	            if (n % i == 0 || n % (i + 2) == 0) 
	                return false; 
	        return true; 
	    } 
     static int gcd(int a, int b) 
     { 
         if (a == 0) 
             return b; 
         return gcd(b % a, a); 
     } 
     static long gcd(long a, long b) 
     { 
         if (a == 0) 
             return b; 
         return gcd(b % a, a); 
     } 
     
        
    static class FastReader 
    { 
        BufferedReader br; 
        StringTokenizer st; 
  
        public FastReader() 
        { 
            br = new BufferedReader(new
                     InputStreamReader(System.in)); 
        } 
  
        String next() 
        { 
            while (st == null || !st.hasMoreElements()) 
            { 
                try
                { 
                    st = new StringTokenizer(br.readLine()); 
                } 
                catch (IOException  e) 
                { 
                    e.printStackTrace(); 
                } 
            } 
            return st.nextToken(); 
        } 
  
        int nextInt() 
        { 
            return Integer.parseInt(next()); 
        } 
  
        long nextLong() 
        { 
            return Long.parseLong(next()); 
        } 
  
        double nextDouble() 
        { 
            return Double.parseDouble(next()); 
        } 
  
        String nextLine() 
        { 
            String str = ""; 
            try
            { 
                str = br.readLine(); 
            } 
            catch (IOException e) 
            { 
                e.printStackTrace(); 
            } 
            return str; 
        } 
    } 
} 
