#include <iostream>
#include <vector>
#include <set>
#include <algorithm>

using namespace std;
using ll = long long;

int main() {
    string s;
    cin >> s;

    set<string> se;
    for (int i = 0; i < 1 << (s.size()); i++) {
        string now;
        int front = 0, back = s.size() - 1;
        for (int j = 0; j < s.size(); j++) {
            if (i & (1 << j))now += s[front++];
            else now += s[back--];
        }
        se.insert(now);
    }

    cout << se.size() << endl;
    return 0;
}