#include <algorithm>
#include <iostream>
#include <vector>
#include <set>
#include <deque>
using namespace std;

int main() {
    string s; cin >> s;
    int n = s.length();
    set<string> res;
    for (int i = 0; i < 1 << n; i++) {
        deque<char> deq(s.begin(), s.end());
        string t = "";
        for (int j = 0; j < n; j++) {
            if (i >> j & 1) t += deq.front(), deq.pop_front();
            else t += deq.back(), deq.pop_back();
        }
        res.emplace(t);
    }
    cout << res.size() << endl;
    return 0;
}