Problem: Kyoya Ootori is selling photobooks of the Ouran High School Host Club. He has 26 photos, labeled "a" to "z", and he has compiled them into a photo booklet with some photos in some order (possibly with some photos being duplicated). A photo booklet can be described as a string of lowercase letters, consisting of the photos in the booklet in order. He now wants to sell some "special edition" photobooks, each with one extra photo inserted anywhere in the book. He wants to make as many distinct photobooks as possible, so he can make more money. He asks Haruhi, how many distinct photobooks can he make by inserting one extra photo into the photobook he already has?

Please help Haruhi solve this problem.

Input

The first line of input will be a single string s (1 ≤ |s| ≤ 20). String s consists only of lowercase English letters. 

Output

Output a single integer equal to the number of distinct photobooks Kyoya Ootori can make.

Examples

Input

a


Output

51


Input

hi


Output

76

Note

In the first case, we can make 'ab','ac',...,'az','ba','ca',...,'za', and 'aa', producing a total of 51 distinct photo booklets. 

Solution (in JAVA):

Solution:
import java.util.*;
import java.io.*;
public class Programa {

	 public static int mod;
	// A utility function that returns true if there is a subset of arr[]
	// with sun equal to given sum
	 
	public static boolean isSubsetSum (int arr[], int n, int sum)
	{
	   // Base Cases
	   if (sum == 0)
	     return true;
	   if (n == 0 && sum != 0)
	     return false;
	 
	   // If last element is greater than sum, then ignore it
	   if (arr[n-1] > sum)
	     return isSubsetSum (arr, n-1, sum);
	 
	   /* else, check if sum can be obtained by any of the following
	      (a) including the last element
	      (b) excluding the last element
	   */
	   return isSubsetSum (arr, n-1, sum) || isSubsetSum (arr, n-1, sum-arr[n-1]);
	}
	 
	// Returns true if arr[] can be partitioned in two subsets of
	// equal sum, otherwise false
	public static boolean findPartiion (int arr[], int n)
	{
	    // Calculate sum of the elements in array
	    int sum = 0;
	    for (int i = 0; i < n; i++)
	       sum += arr[i];
	 
	    // If sum is odd, there cannot be two subsets with equal sum
	    if (sum%2 != 0)
	       return false;
	 
	    // Find if there is subset with sum equal to half of total sum
	    return isSubsetSum (arr, n, sum/2);
	}
	 
	public static double expectedActions(int[] p)
	{
		double mini = 0.0;
		
		for(int i = 0; i < p.length - 1; i++){
			// zeros
			double tem = 1.0;
			for(int j = 0; j < i; j++){
				tem *= (100 - p[i])/100.0;
			}
			// ones
			for(int j = i; j < p.length; j++){
				tem *= (p[i])/100.0;
			}
			mini += tem;
		}
		for(int i = 1; i < p.length; i++){
			// ones
			double tem = 1.0;
			for(int j = 0; j < i; j++){
				tem *= (p[i])/100.0;
			}
			// zeros
			for(int j = i; j < p.length; j++){
				tem *= (100 - p[i])/100.0;
			}
			mini += tem;
		}
		return mini;
	}
	 public static void main(String [] args){	
	    	Scanner scan = new Scanner (System.in);
	    	String alph = "abcdefghijklmnopqrstuvwxyz";
	    	
	    	char [] cad = scan.next().toCharArray();
	    	HashSet<String> set = new HashSet<String>();
	    	for(int k = 0; k < 26; k++){
	    		
	    		for(int i = 0; i <= cad.length; i++){
	    			String tem = "";
	    			for(int j = 0; j < cad.length; j++){
	    				if(i == j)
	    					tem += alph.charAt(k);
	    				tem += cad[j];
	    			}
	    			if(i == cad.length)
	    				tem += alph.charAt(k);
	    			set.add(tem);
	    		}
	    		
	    	}
	    	System.out.println(set.size());
	    }
	
	 public static long fastPower(long base, long exponent){
		 if(exponent == 0){
			 return 1;
		 }
		 long x = fastPower(base, exponent >> 1);
		 x = x * x % mod;
		 if((exponent & 1) != 0) 
			 x = x * base % mod;
		 return x;
	 }	
	 
	 public static long fibonacci(long n){
		 Matrix matrix = new Matrix(new long[][]{{1,1},{1,0}});
		 matrix = fastPower(matrix, n);
		 return matrix.matrix[0][0];
	 }
	 
	 
	 public static Matrix fastPower(Matrix base, long exponent){
		 if(exponent == 1) return base;
		 Matrix x = fastPower(base, exponent >> 1);
		 x = myltiplyMatrix(x,x);
		 return x;
	 }
	 
	 public static Matrix myltiplyMatrix(Matrix a, Matrix b){
		 Matrix matrix = new Matrix();
		 for(int i = 0; i < 2; i++)
			 for(int j = 0; j < 2; j++)
				 for(int k = 0; k < 2; k++)
					 matrix.matrix[i][k] = (matrix.matrix[i][k]	+ a.matrix[i][j]*b.matrix[j][k]) & mod;
		 return matrix;
	 }
	 
	 public static class Matrix{
		 private long[][] matrix;
		 public Matrix(){
			 matrix = new long[2][2];
		 }
		 public Matrix(long[][] c){
			 matrix = c.clone();
		 }
	 }
    /*
     
    	 
	 
    	
     */
}