#include<bits/stdc++.h>
using namespace std;
#define fr(i,a,b) for(int i=a;i<=b;i++)
#define ull unsigned long long
#define ll long long
#define mod 998244353
#define N 1000005
int n,cnt;
char s[N];
int x[N],y[N+N],c[N];
struct SA{
	int sa[N],rk[N],h[N];
	int st[20][N],lg[N];
	void getsa(int n,char* s){
		int m=128;
		fr(i,1,m)c[i]=0;
		fr(i,1,n)c[x[i]=s[i]]++;
		fr(i,1,m)c[i]+=c[i-1];
		for(int i=n;i;i--)sa[c[x[i]]--]=i;
		for(int k=1;k<=n;k<<=1){
			//deal y
			int num=0;
			fr(i,n-k+1,n)y[++num]=i;
			fr(i,1,n)if(sa[i]>k)y[++num]=sa[i]-k;
			//deal c
			fr(i,1,m)c[i]=0;
			fr(i,1,n)c[x[i]]++;
			fr(i,1,m)c[i]+=c[i-1];
			for(int i=n;i;i--)sa[c[x[y[i]]]--]=y[i],y[i]=x[i];//change y
			//deal x
			x[sa[1]]=1,num=1;
			fr(i,2,n)x[sa[i]]=(y[sa[i]]==y[sa[i-1]]&&y[sa[i]+k]==y[sa[i-1]+k])?num:++num;
			if(num==n)break;
			else m=num;
		}
//		fr(i,1,n)printf("%d ",sa[i]);puts("");
	}
	void geth(){
		fr(i,1,n)rk[sa[i]]=i;
		int p=0;
		fr(i,1,n){
			if(p)p--;
			if(rk[i]==1)continue;
			while(i+p<=n&&sa[rk[i]-1]+p<=n&&s[i+p]==s[sa[rk[i]-1]+p])p++;
			h[rk[i]]=p;
		}
//		fr(i,2,n)printf("%d ",h[i]);puts("");
	}
	void initST(){
		fr(i,1,n)st[0][i]=h[i];
		lg[1]=0;fr(i,2,n)lg[i]=lg[i>>1]+1;
		fr(j,1,19)fr(i,1,n-(1<<j)+1)st[j][i]=min(st[j-1][i],st[j-1][i+(1<<(j-1))]);
	}
	int LCP(int u,int v){
		if(u==v)return n-u+1;
		int l=rk[u],r=rk[v];
		if(l>r)swap(l,r);
		l++;
		
		int k=lg[r-l+1];
		return min(st[k][l],st[k][r-(1<<k)+1]);
		
	}
	void init(int n,char* s){
		getsa(n,s);
		geth();
		initST();
	}
}A,B;
map<int,int> mp[N];
void chck(int l,int r,int p){
	if(mp[l].count(r)==0)mp[l][r]=p,cnt++;
}
int main(){
	scanf("%s",s+1);
	n=strlen(s+1);
	A.init(n,s);
	reverse(s+1,s+n+1);
	B.init(n,s);
	reverse(s+1,s+n+1);
	fr(p,1,(n>>1)){
		for(int i=p;i+p<=n;i+=p){
			int j=i+p;
			int l=B.LCP(n-i+1,n-j+1),r=A.LCP(i,j);
			if(l+r>p)chck(i-l+1,j+r-1,p);
		}
	}
	printf("%d\n",cnt);
	fr(l,1,n)for(auto p:mp[l])printf("%d %d %d\n",l,p.first,p.second);
	return 0;
}