#include <bits/stdc++.h>

using namespace std;

#define int long long
// #define double long double
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for(ll i = (a); i > (b); --i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define REPR(i, n) for(ll i = n; i >= 0; i--)
#define FOREACH(x, a) for(auto &(x) : (a))
#define VECCIN(x)                                                              \
    for(auto &youso_ : (x)) cin >> youso_
#define bitcnt __builtin_popcount
#define SZ(x) ((ll)(x).size())
#define fi first
#define se second
#define All(a) (a).begin(), (a).end()
#define rAll(a) (a).rbegin(), (a).rend()

template <typename T = long long> inline T IN() {
    T x;
    cin >> x;
    return (x);
}
inline void CIN() {}
template <class Head, class... Tail>
inline void CIN(Head &&head, Tail &&... tail) {
    cin >> head;
    CIN(move(tail)...);
}
#define CCIN(...)                                                              \
    char __VA_ARGS__;                                                          \
    CIN(__VA_ARGS__)
#define DCIN(...)                                                              \
    double __VA_ARGS__;                                                        \
    CIN(__VA_ARGS__)
#define LCIN(...)                                                              \
    ll __VA_ARGS__;                                                            \
    CIN(__VA_ARGS__)
#define SCIN(...)                                                              \
    string __VA_ARGS__;                                                        \
    CIN(__VA_ARGS__)
#define Yes(a) cout << (a ? "Yes" : "No") << "\n"
#define YES(a) cout << (a ? "YES" : "NO") << "\n"
#define Printv(v)                                                              \
    {                                                                          \
        FOREACH(x, v) { cout << x << " "; }                                    \
        cout << "\n";                                                          \
    }
template <typename T = string> inline void eputs(T s) {
    cout << s << "\n";
    exit(0);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
    std::fill((T *)array, (T *)(array + N), val);
}

template <typename T> using PQG = priority_queue<T, vector<T>, greater<T>>;
template <typename T> using PQ = priority_queue<T>;

typedef long long ll;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<ll, ll> PL;
typedef vector<PL> VPL;
typedef vector<bool> VB;
typedef vector<double> VD;
typedef vector<string> VS;

const int INF = 1e9;
const int MOD = 1e9 + 7;
// const int MOD = 998244353;
const ll LINF = 5e18;
// const double PI = atan(1.0) * 4.0;
const ll dx[] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
#define PI 3.141592653589793238

struct KMP {
    string pat;
    vector<int> fail;

    // construct
    KMP(const string &p) { init(p); }
    void init(const string &p) {
        pat = p;
        int m = (int)pat.size();
        fail.assign(m + 1, -1);
        for(int i = 0, j = -1; i < m; ++i) {
            while(j >= 0 && pat[i] != pat[j]) j = fail[j];
            fail[i + 1] = ++j;
        }
    }

    // the period of S[0:i]
    int period(int i) { return i - fail[i]; }

    // the index i such that S[i:] has the exact prefix p
    vector<int> match(const string &S) {
        int n = (int)S.size(), m = (int)pat.size();
        vector<int> res;
        for(int i = 0, k = 0; i < n; ++i) {
            while(k >= 0 && S[i] != pat[k]) k = fail[k];
            ++k;
            if(k == m) res.push_back(i - m + 1);
        }
        return res;
    }
};

VL divisor(ll n) {
    VL res;
    for(ll i = 1; i * i <= n; i++) {
        if(n % i == 0) {
            res.push_back(i);
            if(i != n / i) res.push_back(n / i);
        }
    }
    return res;
}

signed main() {
    SCIN(S);
    ll N = S.length();
    VL divs = divisor(N);
    ll mi = LINF;
    for(auto d : divs) {
        bool ok = true;
        for(int j = 0; j + d < N; ++j) {
            if(S[j] != S[j + d]) ok = false;
        }
        if(ok) mi = min(mi, d);
    }
    if(mi == 1)
        cout << N << "\n" << 1 << "\n";
    else if(mi == N)
        cout << 1 << "\n" << 1 << "\n";
    else {
        string SS = S;
        reverse(All(SS));
        KMP kmp1(S), kmp2(SS);
        VB ok(N, true);
        FOR(d, 2, N) {
            if(kmp1.period(d) < d && d % kmp1.period(d) == 0) ok[d] = false;
            if(kmp2.period(d) < d && d % kmp2.period(d) == 0) ok[N - d] = false;
        }
        ll cnt = 0;
        FOR(i, 1, N) if(ok[i]) cnt++;
        printf("%lld\n%lld\n", 2, cnt);
    }
}


Measured memory_bytes: 10116