#include <bits/stdc++.h>
using namespace std;

using ui = unsigned;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define rep(i,l,r) for(int i=(l);i<=(r);++i)
#define per(i,l,r) for(int i=(l);i>=(r);--i)
#define repn(i,n) for(int i=0;i<(n);++i)
#define sizc(x) ((int)(x).size())
#define allc(x) (x).begin(),(x).end()
#define fir first
#define sec second

constexpr int N = 1e6+5;

int n;
string s;
ull h[N],pw[N];
ull gh(int l,int r){return h[r]-h[l-1]*pw[r-l+1];}

int lcp(int x,int y){
    if(x<1||x>n||y<1||y>n)return 0;
    int l=0,r=n-max(x,y)+1;
    while(l<r){
        int mid=l+r+1>>1;
        if(gh(x,x+mid-1)==gh(y,y+mid-1))l=mid;
        else r=mid-1;
    }
    return l;
}
int lcs(int x,int y){
    if(x<1||x>n||y<1||y>n)return 0;
    int l=0,r=min(x,y);
    while(l<r){
        int mid=l+r+1>>1;
        if(gh(x-mid+1,x)==gh(y-mid+1,y))l=mid;
        else r=mid-1;
    }
    return l;
}
bool cmp(int x,int y){
    int l=lcp(x,y);
    return s[x+l]<s[y+l];
}

struct run{
    int l,r,p;
    bool operator<(const run &o)const{return l==o.l?r<o.r:l<o.l;}
    bool operator==(const run &o)const{return l==o.l&&r==o.r;}
};
vector<run> runs;
void chk(int i,int j){
    int l=i-lcs(i-1,j),r=j+lcp(i,j+1);
    if(r-l+1>=2*(j-i+1))runs.push_back({l,r,j-i+1});
}

int stk[N],tp;

signed main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

    cin>>s,n=s.size(),s=' '+s+' ';
    pw[0]=1;rep(i,1,n)pw[i]=pw[i-1]*131,h[i]=h[i-1]*131+s[i];
    
    per(i,n,1){
        while(tp&&cmp(i,stk[tp]))--tp;
        if(tp)chk(i,stk[tp]-1);
        stk[++tp]=i;
    }
    tp=0;
    per(i,n,1){
        while(tp&&!cmp(i,stk[tp]))--tp;
        if(tp)chk(i,stk[tp]-1);
        stk[++tp]=i;
    }
    sort(allc(runs)),runs.erase(unique(allc(runs)),runs.end());
    cout<<runs.size()<<'\n';
    for(auto i:runs)cout<<i.l<<' '<<i.r<<' '<<i.p<<'\n';
}