#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
using vi  = vector<int>;
using vvi = vector<vi>;

struct SuffixArray {
	string s;
	int n;
	vvi P;
	SuffixArray(string &_s) : s(_s), n(_s.length()) { construct(); }
	void construct() {
		P.push_back(vi(n, 0));
		compress();
		vi occ(n + 1, 0), s1(n, 0), s2(n, 0);
		for(int k = 1, cnt = 1; cnt / 2 < n; ++k, cnt *= 2) {
			P.push_back(vi(n, 0));
			fill(occ.begin(), occ.end(), 0);
			for(int i = 0; i < n; ++i) occ[i + cnt < n ? P[k - 1][i + cnt] + 1 : 0]++;
			partial_sum(occ.begin(), occ.end(), occ.begin());
			for(int i = n - 1; i >= 0; --i) s1[--occ[i + cnt < n ? P[k - 1][i + cnt] + 1 : 0]] = i;
			fill(occ.begin(), occ.end(), 0);
			for(int i = 0; i < n; ++i) occ[P[k - 1][s1[i]]]++;
			partial_sum(occ.begin(), occ.end(), occ.begin());
			for(int i = n - 1; i >= 0; --i) s2[--occ[P[k - 1][s1[i]]]] = s1[i];
			for(int i = 1; i < n; ++i) {
				P[k][s2[i]] = same(s2[i], s2[i - 1], k, cnt) ? P[k][s2[i - 1]] : i;
			}
		}
	}
	bool same(int i, int j, int k, int l) {
		return P[k - 1][i] == P[k - 1][j] &&
		       (i + l < n ? P[k - 1][i + l] : -1) == (j + l < n ? P[k - 1][j + l] : -1);
	}
	void compress() {
		vi cnt(256, 0);
		for(int i = 0; i < n; ++i) cnt[s[i]]++;
		for(int i = 0, mp = 0; i < 256; ++i)
			if(cnt[i] > 0) cnt[i] = mp++;
		for(int i = 0; i < n; ++i) P[0][i] = cnt[s[i]];
	}
	vi &get_array() & { return P.back(); }
	vi &&get_array() && { return move(P.back()); }
	int lcp(int x, int y) {
		int ret = 0;
		if(x == y) return n - x;
		for(int k = P.size() - 1; k >= 0 && x < n && y < n; --k)
			if(P[k][x] == P[k][y]) {
				x += 1 << k;
				y += 1 << k;
				ret += 1 << k;
			}
		return ret;
	}
};

int main() {
	string s;
	cin >> s;
	int n = s.size();
	SuffixArray sa(s);
	auto array = sa.get_array();
	vi inv(array.size());
	for(int i = 0; i < array.size(); ++i) inv[array[i]] = i;

	int ans = 0;
	int l = 0, r = n;
	int i = 1;
	for(; i <= n - i; ++i) {
		// compare [l,i) and [n-i,r)
		if(sa.lcp(l, n - i) >= i - l) {
			ans += 2;
			l = i;
			r = n - i;
		}
	}
	if(l < r) ++ans;
	std::cout << ans << std::endl;

	return 0;
}