string s;
cin >> s;
cin.ignore()
getline(cin, s);
s += 'a';
cout << s.size() << endl;
cout << s[0] << endl;
cout << s.substr(0, 5) << endl;
reverse(s.begin(), s.end());

int main() {
    string a, b;
    cin >> a >> b;
    int same = 1;
    for (int i = 0;i < a.size();i++) {
        if (a[i] == b[i]) {
		    same = 0;
            break;
        }
    }
    if (same) {
    	cout << "JIZZ" << endl;
    } else {
    	cout << 7122 << endl;
    }
}

#include <iostream>
#include <vector>
#define ll long long
using namespace std;
const ll P = 401, M = 998244353;
ll hashes[10005], modp[10005];
ll hashp(string s, bool saveval) {
    ll val = 0;
    int index = 0;
    for (char c:s) {
    	val = ((val * P) % M + c) % M;
    	if (saveval) hashes[index] = val;
    	//cout << val << endl;
    	++index;
    }
    return val;
}
void modpow(int base, int exp) {
	ll b = 1;
	modp[0] = 1;
	for (int i = 0; i < exp; i++) {
		b = (b * base) % M;
		modp[i + 1] = b;
	}
}
ll subseq (int l, int r) { //[l, r]
	if (l == 0) return hashes[r];
	return(((hashes[r] - hashes[l - 1] * modp[r - l + 1]) % M + M) % M);
}
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	int n;
	cin >> n;
	modpow(P, 10001);
	for (int i = 0; i < n; ++i) {
		string T;
		int q;
		cin >> T;
		ll useless = hashp(T, true);
		cin >> q;
		for (int j = 0; j < q; ++j) {
			string p;
			cin >> p;
			ll h = hashp(p, false);
			int cnt = 0;
			for (int k = 0; k < T.size() - p.size() + 1;++k) {
				//cout << h << " " << subseq(k, k + p.size() - 1) << endl;
				if (subseq(k, k+p.size() - 1) == h) ++cnt;
			}
			cout << cnt << "\n";
		}
	}
	return 0;
}

while (i + cnt < ps && p[cnt] == p[i + cnt]) {
    cnt++;
}

#include <iostream>
#include <algorithm>
#include <string>
#define ll long long
#define maxn 20005
using namespace std;
int z[maxn];
int main() {
	ios_base::sync_with_stdio(0);cin.tie(0);
	int t;
	cin >> t;
	while (t--) {
		string s;
		cin >> s;
		int q;
		cin >> q;
		while (q--) {
			string p;
			cin >> p;
			int ans = 0;
			int l = 0, r = 0, ps = p.size(), ss = s.size();
			z[0] = 0;
			int cnt;
			for (int i = 1;i < ps;i++) {
				if (i > r) cnt = 0;
				else cnt = min(r - i + 1, z[i - l]);
				while (i + cnt < ps && p[cnt] == p[i + cnt]) cnt++;
				z[i] = cnt;
				cnt--;
				if (i + cnt > r) l = i, r = i + cnt;
			}
			z[ps] = 0;
			for (int i = 0;i < ss - ps + 1;i++) {
				if (i + ps + 1 > r) cnt = 0;
				else cnt = min(r - int(ps + i), z[ps + i + 1 - l]);
				while (i + cnt < ss && cnt < ps && p[cnt] == s[i + cnt]) cnt++;
				z[ps + i + 1] = cnt;
				if (cnt == ps) ans++;
				cnt--;
				if (i + cnt > r) l = ps + 1 + i, r = ps + 1 + i + cnt;
			}
			cout << ans << "\n";
		}
	}
	return 0;
}

#include <iostream>
#include <algorithm>
#include <string>
#define ll long long
#define maxn 20005
using namespace std;
int kmp[maxn];
int main() {
	ios_base::sync_with_stdio(0);cin.tie(0);
	int t;
	cin >> t;
	while (t--) {
		string s;
		cin >> s;
		int q;
		cin >> q;
		while (q--) {
			string p;
			cin >> p;
			int ps = p.size(), ss = s.size(), ans = 0;
			kmp[0] = 0;
			for (int i = 1;i < ps;i++) {
				kmp[i] = kmp[i - 1];
				while (p[i] != p[kmp[i]]) {
					if (kmp[i] == 0) {
						kmp[i] = -1;
						break;
					}
					kmp[i] = kmp[kmp[i] - 1];
				}
				kmp[i]++;
			}
			int ind = 0;
			for (int m = 0;m < ss - ps + 1;) {
				while (ind < ps && p[ind] == s[m + ind]) ind++;
				ind--;
				if (ind == ps - 1) ans++;
				if (ind == -1) {
					m++;
					ind = 0;
				} else {
					m = m + ind - kmp[ind] + 1;
					ind = kmp[ind];
				}
			}
			cout << ans << "\n";
		}
	}
	return 0;
}