#include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for(LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for(LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it)
#define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it)
#define EXIST(c,x) ((c).find(x) != (c).end())
#define fst first
#define snd second
#define popcount __builtin_popcount
#define UNIQ(v) v.erase(unique(ALL(v)), v.end())
#define bit(i) (1LL<<i)
#define sz(v) ((LLI)(v).size())

#ifdef DEBUG
#include <misc/C++/Debug.cpp>
#else
#define dump(...) ((void)0)
#endif

#define gcd __gcd

using namespace std;
template <class T> constexpr T lcm(T m, T n){return m/gcd(m,n)*n;}

template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;}
template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;}
template <typename T, typename U> istream& operator>>(istream &is, pair<T,U> &p){is >> p.first >> p.second; return is;}

template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);}
template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);}
template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);}

template <typename T> class RollingHash{
private:
  T str;
  LLI base, mod;
  int sl;
  vector<LLI> shash, pow;
public:
  RollingHash(const T &str, LLI base, LLI mod): str(str), base(base), mod(mod), sl(str.size()), shash(sl+1), pow(sl+1){
    pow[0] = 1;
    shash[0] = 0;
    FORE(i,1,sl){
      shash[i] = (shash[i-1]*base+str[i-1]) % mod;
      pow[i] = pow[i-1]*base % mod;
    }
  }

  LLI hash(int i, int j){ // [i, j)
    return (shash[j] - shash[i] * pow[j-i] + mod*mod) % mod;
  }

  LLI hash(const T &p){
    LLI phash = 0;
    REP(i,(int)p.size()) phash = (phash*base+p[i]) % mod;
    return phash;
  }
  
  vector<int> find(const T &p){
    vector<int> ret;
    int pl = p.size();
    LLI phash = hash(p);
    REPE(i,sl-pl) if(hash(i,i+pl) == phash) ret.push_back(i);
    return ret;
  }
};

const LLI mod = 1e9+7;

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

  string s;
  while(cin >> s){
    int n = s.size();

    RollingHash<string> rh(s, 31, mod);

    int ans = 0;
    LLI ans_count = 0;

    int p = n;
    vector<bool> is_good(n+1, true);
    vector<bool> is_good_rev(n+1, true);

    FORE(i,1,n){
      for(int k=2*i; k<=n; k+=i){
	if(rh.hash(0,i) == rh.hash(k-i,k)){
	  is_good[k] = false;
	  if(k==n){
	    chmin(p,i);
	  }
	}else{
	  break;
	}
      }
    }

    FORE(i,1,n){
      for(int k=n-2*i; k>=0; k-=i){
	if(rh.hash(n-i,n) == rh.hash(k,k+i)){
	  is_good_rev[k] = false;
	}else{
	  break;
	}
      }
    }
    
    dump(is_good);
    dump(is_good_rev);
    dump(p);
    
    
    if(all_of(ALL(s), [&](char c){return c == s[0];})){
      ans = n;
      ans_count = 1;
    }else if(is_good[n]){
      ans = 1;
      ans_count = 1;
    }else{
      ans = 2;

      FOR(i,1,n){
	if(is_good[i] and is_good_rev[i]) ++ans_count;
      }
    }

    cout << ans << endl;
    cout << ans_count << endl;
  }
  
  return 0;
}


Measured memory_bytes: 9244