#include <bits/stdc++.h>
#include <unistd.h>

using namespace std;

#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}


typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1000000007;
//const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { 1,0, -1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
//#define mp make_pair


class RollingHash {
public:
  using ull = unsigned long long;
  using P = pair<ll, ull>;
  const ll B1 = 100000007;
  const ll M = 1000000009;
  const ull B2 = 100000007;
  
  int n;
  string s;
  vector<P> hash;
  vector<ll> Bpower1;
  vector<ull> Bpower2;

  RollingHash(string s) :s(s), n(s.size()) {
    hash.resize(n + 1); Bpower1.resize(n + 1); Bpower2.resize(n + 1);
    Bpower1[0] = Bpower2[0] = 1;
    for (int i = 0; i < n; i++) {
      hash[i + 1].first = (hash[i].first * B1 % M + s[i]) % M;
      hash[i + 1].second = hash[i].second * B2 + s[i];
      Bpower1[i + 1] = Bpower1[i] * B1 % M;
      Bpower2[i + 1] = Bpower2[i] * B2;
    }
  }

  //S[l, r)
  P part(int l, int r) {
    P res = hash[r];
    (res.first -= hash[l].first * Bpower1[r - l] % M) %= M;
    res.first = (res.first + M) % M;
    res.second -= hash[l].second * Bpower2[r - l];
    return res;
  }
};

int main() {
  string s;
  cin >> s;
  int n = s.size();
  
  RollingHash rh(s);
  int mlen = inf;
  vi out(n + 1);
  for (int len = 1; len < n; len++) {
    auto h = rh.part(0, len);
    bool flag = true;
    if (n % len != 0) flag = false;
    for (int l = len; l + len <= n; l += len) {
      if (rh.part(l, l + len) != h) {
        flag = false;
        break;
      }
      out[l + len] = true;
    }
    if (flag) {
      mlen = len;
      break;
    }
  }

  for (int len = 1; len < n; len++) {
    auto h = rh.part(n - len, n);
    for (int l = n - 2*len; l >= 0; l -= len) {
      if (rh.part(l, l + len) != h) break;
      out[l] = true;
    }
  }
  
  if (mlen == inf) {
    cout << 1 << endl;
    cout << 1 << endl;
    return 0;
  }
  else if (mlen == 1) {
    cout << n << endl;
    cout << 1 << endl;
    return 0;
  }
  else {
    cout << 2 << endl;
    int cnt = 0;
    for (int i = 1; i < n; i++) {
      if (!out[i]) cnt++;
    }
    cout << cnt << endl;
  }
}


Measured memory_bytes: 18460