package no052;

import java.util.HashSet;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		char[] s = sc.next().toCharArray();
		int n = s.length;
		String[][] t = new String[(n+1)/2][2];
		for(int i=0;i<n/2;i++) {
			String head = String.valueOf(s[i]);
			String tail = String.valueOf(s[n-1-i]);
			t[i][0] = head + tail;
			t[i][1] = tail + head;
		}
		if (n % 2 == 1) {
			t[n/2][0] = t[n/2][1] = String.valueOf(s[n/2]);
		}
		int m = t.length;
		int[] p = new int[m];
		for(int i=0;i<m;i++) {
			p[i] = i;
		}
		HashSet<String> hs = new HashSet<String>();
		do {
			for(int i=0;i<(1<<m);i++) {
				StringBuilder sb = new StringBuilder();
				for(int j=0;j<m;j++) {
					sb.append(t[p[j]][(i>>j)&1]);
				}
				hs.add(sb.toString());
			}
		} while(nextPermutation(p));
		System.out.println(hs.size());
	}

	static boolean nextPermutation(int[] p) {
		for(int a=p.length-2;a>=0;--a) {
			if(p[a]<p[a+1]) {
				for(int b=p.length-1;;--b) {
					if(p[b]>p[a]) {
						int t = p[a];
						p[a] = p[b];
						p[b] = t;
						for(++a, b=p.length-1;a<b;++a,--b) {
							t = p[a];
							p[a] = p[b];
							p[b] = t;
						}
						return true;
					}
				}
			}
		}
		return false;
	}
}