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.io.*;
import java.util.*;
 
public class Main {
  public static IO in;
  public static PrintWriter out;
 
  static void init_io(String filename) throws Exception {
    if (filename.equals("")) {
      in = new IO(System.in);
      out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)), true);
    } else {
      in = new IO(new FileInputStream(filename + ".in"));
      out = new PrintWriter(new BufferedWriter(new FileWriter(filename + ".out")), true);
    }
  }
 
  final static long mod = 1_000_000_007;
 
  public static void main(String[] _u_n_u_s_e_d_) throws Exception {
    init_io("");
 
    String s = in.nstr();
    int n = s.length();
    
    TreeSet<String> ts = new TreeSet<String>();
    
    for (int l = 0; l <= n; l++) {
        String a = "", b = "";
        if (l > 0) a = s.substring(0, l);
        if (l < n) b = s.substring(l, n);
        for (char c = 'a'; c <= 'z'; c++) {
            ts.add(a + "" + c + b);
        }
    }
    
    out.println(ts.size());
  }
 
  static int gcd(int a, int b) {
    if (a == 0) return b;
    return gcd(b % a, a);
  }
 
  static void qsort(long[] arr) {
    Long[] oarr = new Long[arr.length];
    for (int i = 0; i < arr.length; i++) {
      oarr[i] = arr[i];
    }
 
    ArrayList<Long> alist = new ArrayList<Long>(Arrays.asList(oarr));
    Collections.sort(alist);
 
    for (int i = 0; i < arr.length; i++) {
      arr[i] = alist.get(i);
    }
  }
 
  static void reverse(long[] arr) {
    for (int i = 0; i < arr.length / 2; i++) {
      long temp = arr[i];
      arr[i] = arr[arr.length - 1 - i];
      arr[arr.length - 1 - i] = temp;
    }
  }
 
  static String atos(long[] arr) {
    String s = Arrays.toString(arr);
    s = s.substring(1, s.length() - 1);
    return s.replace(",", "");
  }
 
  static class IO {
    public BufferedReader in;
    public StringTokenizer tokens;
 
    public IO(InputStream x) throws Exception {
      in = new BufferedReader(new InputStreamReader(x));
      tokens = new StringTokenizer(in.readLine());
    }
 
    int nint() throws Exception {
      return Integer.parseInt(nstr());
    }
 
    long nlong() throws Exception {
      return Long.parseLong(nstr());
    }
 
    double ndouble() throws Exception {
      return Double.parseDouble(nstr());
    }
 
    String nstr() throws Exception {
      if (!tokens.hasMoreTokens()) tokens = new StringTokenizer(in.readLine());
      return tokens.nextToken();
    }
    
    long[] nla(int n) throws Exception {
      long[] arr = new long[n];
      for (int i = 0; i < n; i++) {
        arr[i] = nlong();
      }
      return arr;
    }
  }
 
  static class Pair<A extends Comparable<A>, B extends Comparable<B>> implements Comparable<Pair<A, B>> {
    public A f;
    public B s;
 
    public Pair(A a, B b) {
      f = a;
      s = b;
    }
 
    public int compareTo(Pair<A, B> other) {
      int v = f.compareTo(other.f);
      if (v != 0) return v;
      return s.compareTo(other.s);
    }
 
    public String toString() {
      return "(" + f.toString() + ", " + s.toString() + ")";
    }
  }
}