#include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <time.h>
#include <random>
#include <string>
#include <cassert>
#include <vector>
#include <ostream>
#include <istream>
#include <stack>
#include <deque>
#include <queue>
#include <functional>
#include <chrono>
#include <stack>

using namespace std;

#define int long long
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define pii pair<int, int>
#define ld long double

ostream& operator<< (ostream &out, const vector<int> &b) {
    for (auto k : b) out << k << " ";
    return out;
}

istream& operator>> (istream& in, pii& b) {
    in >> b.first >> b.second;
    return in;
}

ostream& operator<< (ostream& out, const pii& b) {
    out << "{" << b.first << ", " << b.second << "}";
    return out;
}

template <typename T1, typename T2> inline bool chkmin(T1 &x, const T2 &y) {if (x > y) {x = y; return 1;} return 0;}
template <typename T1, typename T2> inline bool chkmax(T1 &x, const T2 &y) {if (x < y) {x = y; return 1;} return 0;}


#ifdef LOCAL
    #define dbg(x) cout << #x << " : " << (x) << "\n";
    const int INF = 1e18;
    const int mod = 2600000069;
    const int p = 10;
#else
    #define dbg(x) 57
    const int INF = 1e18;
    const int mod = 2600000069;
    const int p = 179;
#endif

const ld PI = acos(-1);

#define time clock() / (double) CLOCKS_PER_SEC

// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC target("sse,sse2,sse3,sse3,sse4")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("fast-math")
// #pragma GCC target("avx2")  
// #pragma GCC optimize("section-anchors")
// #pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
// #pragma GCC optimize("vpt")
// #pragma GCC optimize("rename-registers")
// #pragma GCC optimize("move-loop-invariants")
// #pragma GCC optimize("unswitch-loops")
// #pragma GCC optimize("function-sections")
// #pragma GCC optimize("data-sections")

mt19937 gen(chrono::high_resolution_clock::now().time_since_epoch().count());

const int MAXN = 5e5 + 10;

int n;
int pw[MAXN], h[MAXN];
string s;

int subh(int l, int r) {
    int b = h[r], s = 0;
    if (l > 0) {
        s = h[l - 1] * pw[r - l + 1] % mod;
    }
    if (b - s < 0) return b - s + mod;
    return b - s;
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    pw[0] = 1;
    for (int i = 1; i < MAXN; i++) {
        pw[i] = pw[i - 1] * p % mod;
    }
    cin >> s;
    n = s.size();
    h[0] = s[0] - 'a' + 1;
    for (int i = 1; i < n; i++) {
        h[i] = (h[i - 1] * p + s[i] - 'a' + 1) % mod;
    }
    int t = -1;
    for (int i = 1; i < n; i++) {
        if (n % i) continue;
        bool ok = 1;
        for (int j = i; j < n; j += i) {
            if (subh(j, j + i - 1) != subh(0, i - 1)) {
                ok = 0;
                break;
            }
        }
        if (ok) {
            t = i;
            break;
        }
    }
    if (t == -1) {
        cout << "1\n1\n";
        return 0;
    }
    if (t == 1) {
        cout << n << "\n1\n";
        return 0;
    }
    vector<int> bad(n + 1, 0);
    for (int i = 1; i < n; i++) {
        for (int j = i; j + i - 1 < n; j += i) {
            if (subh(0, i - 1) == subh(j, j + i - 1)) {
                bad[j + i] = 1;
            } else {
                break;
            }
        }
    }
    for (int i = 1; i < n; i++) {
        for (int j = n - i - 1; j - i + 1 >= 0; j -= i) {
            if (subh(j - i + 1, j) == subh(n - i, n - 1)) {
                bad[j - i + 1] = 1;
            } else {
                break;
            }
        }
    }
    int ans = 0;
    for (int i = 0; i <= n; i++) {
        ans += !bad[i];
    }
    cout << 2 << "\n" << ans << "\n";
}
/*

*/

Measured memory_bytes: 15476