#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define endl '\n'

vector<int> Z_algo(string S){
    int l = S.size();
    vector<int> Z(l, 0);
    Z[0] = l;
    int i = 1;
    int j = 0;
    while(i < l){
        while (i + j < l && S[j] == S[i + j]) j++;
        Z[i] = j;
        if(j == 0){
            i++;
            continue;
        }
        int k = 1;
        while(i + k < l && k + Z[k] < j){
            Z[i + k] = Z[k];
            k++;
        }
        i += k;
        j -= k;
    }
    return Z;
}

int main(){
    string S;
    cin >> S;
    int n = S.size(); 
    auto Z = Z_algo(S);

    vector<vector<int>> ma(20, vector<int>(n, 0));
    vector<vector<int>> nex(20, vector<int>(n, 0));
    ma[0] = Z;
    for(int j = 0; j < n; j++){
        if(j == n - 1) nex[0][j] = j; 
        else nex[0][j] = j + 1;
    }
    for(int i = 1; i < 20; i++){
        for(int j = 0; j < n; j++){
            int k = nex[i - 1][j];
            nex[i][j] = nex[i - 1][k];
            ma[i][j] = max(ma[i - 1][j], ma[i - 1][k]);
        }
    }

    vector<int> mi(n, 0);
    for(int i = 1; i < n; i++){
        mi[i] = min(mi[i], mi[i - 1]);
        int x = mi[i] + 1;
        int j = i + 1;
        int z = i + 1;
        while(j < n){
            if(ma[19][j] < z) break;
            int d = 0;
            for(int k = 19; k >= 0; k--){
                if(ma[k][j] < z) j = nex[k][j];
            }
            j += z - 1;
            x -= z - 1;
            mi[j] = min(mi[j], x);
            j++;
        }
    }
    cout << n + mi[n - 1] << endl;
}