#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int P1 = 1e9 + 7, P2 = 998244353, B = 251;
char s[1000005];
int n;
ll h1[1000005], h2[1000005];
ll pw1[1000005], pw2[1000005];
ll H1(int l, int r) { return (h1[r] - h1[l - 1] * pw1[r - l + 1] % P1 + P1) % P1; }
ll H2(int l, int r) { return (h2[r] - h2[l - 1] * pw2[r - l + 1] % P2 + P2) % P2; }
int LCP(int x, int y) {
	int l = 0, r = n - max(x, y) + 1, res = 0;
	while (l <= r) {
		int mid = l + r >> 1;
		if (H1(x, x + mid - 1) == H1(y, y + mid - 1) && H2(x, x + mid - 1) == H2(y, y + mid - 1)) {
			res = mid;
			l = mid + 1;
		}
		else r = mid - 1;
	}
	return res;
}
int LCS(int x, int y) {
	int l = 0, r = min(x, y), res = 0;
	while (l <= r) {
		int mid = l + r >> 1;
		if (H1(x - mid + 1, x) == H1(y - mid + 1, y) && H2(x - mid + 1, x) == H2(y - mid + 1, y)) {
			res = mid;
			l = mid + 1;
		}
		else r = mid - 1;
	}
	return res;
}
int CMP(int x, int y) {
	if (x == y) return 0;
	int l = LCP(x, y);
	return s[x + l] < s[y + l] ? -1 : 1;
}
int st[1000005], top;
struct Run {
	int l, r, p;
	bool operator<(const Run &b) const {
		if (l != b.l) return l < b.l;
		if (r != b.r) return r < b.r;
		return p < b.p;
	}
	bool operator==(const Run &b) const { return l == b.l && r == b.r; }
} f[2000005];
int fC;
void Check(int i, int j) {
	int p = j - i + 1;
	int x = i - LCS(i - 1, j), y = j + LCP(i, j + 1);
	if (y - x + 1 >= p * 2) f[++fC] = { x, y, p };
}
int main() {
	scanf("%s", s + 1), n = strlen(s + 1);
	pw1[0] = pw2[0] = 1;
	for (int i = 1; i <= n; i++) pw1[i] = pw1[i - 1] * B % P1, h1[i] = (h1[i - 1] * B + s[i]) % P1;
	for (int i = 1; i <= n; i++) pw2[i] = pw2[i - 1] * B % P2, h2[i] = (h2[i - 1] * B + s[i]) % P2;
	for (int i = n; i; i--) {
		while (top && CMP(i, st[top]) <= 0) top--;
		if (top) Check(i, st[top] - 1);
		st[++top] = i;
	}
	top = 0;
	for (int i = n; i; i--) {
		while (top && CMP(i, st[top]) >= 0) top--;
		if (top) Check(i, st[top] - 1);
		st[++top] = i;
	}
	sort(f + 1, f + fC + 1);
	fC = unique(f + 1, f + fC + 1) - f - 1;
	printf("%d\n", fC);
	for (int i = 1; i <= fC; i++) printf("%d %d %d\n", f[i].l, f[i].r, f[i].p);
	return 0;
}