#include <iostream>
#include <string>
#include <set>

void solve() {
    std::string s;
    std::cin >> s;
    int n = s.length();

    std::set<std::string> ts;
    for (int b = 0; b < (1 << (n - 1)); ++b) {
        std::string t;

        int l = 0, r = n - 1;
        for (int i = 0; i < n - 1; ++i) {
            if ((b >> i) & 1) {
                t += s[l++];
            } else {
                t += s[r--];
            }
        }

        ts.insert(t);
    }

    std::cout << ts.size() << std::endl;
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}