#include <bits/stdc++.h>
template <typename T>
void MACRO_VAR_Scan(T& t) {
  std::cin >> t;
}
template <typename First, typename... Rest>
void MACRO_VAR_Scan(First& first, Rest&... rest) {
  std::cin >> first;
  MACRO_VAR_Scan(rest...);
}
template <typename T>
void MACRO_VEC_ROW_Init(int n, T& t) {
  t.resize(n);
}
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Init(int n, First& first, Rest&... rest) {
  first.resize(n);
  MACRO_VEC_ROW_Init(n, rest...);
}
template <typename T>
void MACRO_VEC_ROW_Scan(int p, T& t) {
  std::cin >> t[p];
}
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Scan(int p, First& first, Rest&... rest) {
  std::cin >> first[p];
  MACRO_VEC_ROW_Scan(p, rest...);
}
template <typename T>
inline T CHMAX(T& a, const T b) {
  return a = (a < b) ? b : a;
}
template <typename T>
inline T CHMIN(T& a, const T b) {
  return a = (a > b) ? b : a;
}
void CHECKTIME(std::function<void()> f) {
  auto start = std::chrono::system_clock::now();
  f();
  auto end = std::chrono::system_clock::now();
  auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start))
                 .count();
  std::cerr << "[Time:" << res << "ns  (" << res / (1.0e9) << "s)]\n";
}
template <class T>
std::vector<std::vector<T>> VV(int n) {
  return std::vector<std::vector<T>>(n);
}
template <class T>
std::vector<std::vector<T>> VV(int n, int m, T init = T()) {
  return std::vector<std::vector<T>>(n, std::vector<T>(m, init));
}
template <typename S, typename T>
std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {
  os << "(" << p.first << ", " << p.second << ")";
  return os;
}
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using PAIR = std::pair<ll, ll>;
using PAIRLL = std::pair<ll, ll>;
constexpr ll INFINT = 1 << 30;
constexpr ll INFINT_LIM = (1LL << 31) - 1;
constexpr ll INFLL = 1LL << 60;
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62);
constexpr double EPS = 1e-9;
constexpr ll MOD = 1000000007;
constexpr double PI = 3.141592653589793238462643383279;
struct Zalgorithm {
  std::string s;
  std::vector<ll> z;
  Zalgorithm(std::string s) : s(s), z(s.size()) {
    z[0] = s.size();
    ll i = 1, j = 0;
    while (i < s.size()) {
      while (i + j < s.size() && s[j] == s[i + j]) ++j;
      z[i] = j;
      if (j == 0) {
        ++i;
        continue;
      }
      ll k = 1;
      while (i + k < s.size() && k + z[k] < j) z[i + k] = z[k], ++k;
      i += k;
      j -= k;
    }
  }
  ll& operator[](ll i) { return z[i]; }
};
std::vector<ll> enumerateDivisors(ll n) {
  std::set<ll> set;
  for (ll i = 1; i * i <= n; ++i) {
    if (n % i) continue;
    set.insert(i);
    set.insert(n / i);
  }
  std::vector<ll> res(set.size());
  ll p = 0;
  for (const auto& x : set) {
    res[p++] = x;
  }
  return res;
}
signed main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);
  ;
  std::string s;
  MACRO_VAR_Scan(s);
  ;
  ll n = s.size();
  auto vd(enumerateDivisors(n));
  bool isGood = true;
  std::vector<bool> ok(n - 1, true);
  for (auto d : vd) {
    std::string t(s.substr(0, d));
    std::string ss;
    while (ss.size() < s.size()) ss += t;
    if (ss == s) {
      if (d == 1) {
        std::cout << n;
        std::cout << "\n";
        ;
        std::cout << 1;
        std::cout << "\n";
        ;
        return 0;
      } else if (d == n) {
        std::cout << 1;
        std::cout << "\n";
        ;
        std::cout << 1;
        std::cout << "\n";
        ;
        return 0;
      } else {
        std::cout << 2;
        std::cout << "\n";
        ;
        Zalgorithm Z(s);
        std::reverse((s).begin(), (s).end());
        Zalgorithm Zi(s);
        std::vector<bool> ok(n + 1, true);
        for (ll i = (1); i < (n); ++i) {
          if (i <= Z[i]) {
            for (ll k = 0; k < ll(Z[i] / i); ++k) {
              if (i * (k + 2) >= n) continue;
              ok[i * (k + 2)] = false;
            }
          }
        }
        for (ll i = (1); i < (n); ++i) {
          if (i <= Zi[i]) {
            for (ll k = 0; k < ll(Zi[i] / i); ++k) {
              if (n - 1 - i * (k + 2) < 0) continue;
              ok[n - 1 - i * (k + 2)] = false;
            }
          }
        }
        ll cnt = 0;
        for (ll i = (1); i < (n); ++i) cnt += ok[i];
        std::cout << cnt;
        std::cout << "\n";
        ;
        return 0;
      }
    }
  }
  return 0;
}
