#include <bits/stdc++.h>
using namespace std;
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& vec) {
  os << "[";
  for (int i = 0; i < vec.size(); i++) {
    os << vec[i] << ",";
  }
  os << "]";
  return os;
}
template <typename T>
T input() {
  T t;
  cin >> t;
  return t;
}
template <typename T>
vector<T> input(const int N) {
  vector<T> v(N);
  for (int i = 0; i < static_cast<int>(N); i++) cin >> v[i];
  return v;
}
long long gcd(long long a, long long b) {
  if (b == 0) {
    return a;
  }
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return (a / gcd(a, b)) * b; }
long long mul(const long long& a, const long long& b, const long long& mod) {
  return ((a % mod) * (b % mod)) % mod;
}
long long power(const long long& x, const long long& y, const long long& mod) {
  if (y == 0) {
    return 1;
  } else if (y == 1) {
    return x % mod;
  } else {
    long long value = power(x, y / 2, mod);
    if (y % 2 == 0) {
      return mul(value, value, mod);
    } else {
      return mul(value, value, mod) * x % mod;
    }
  }
}
long long div(const long long& a, const long long& b, const long long& mod) {
  return mul(a, power(b, mod - 2, mod), mod);
}
map<long long, long long> factorials;
long long factorial(const long long& n, const long long& mod) {
  if (n == 0 || n == 1) {
    return 1;
  }
  if (factorials[n] != 0) {
    return factorials[n];
  }
  factorials[n] = n * factorial(n - 1, mod) % mod;
  return factorials[n] % mod;
}
long long combination(const long long& n, const long long& x,
                      const long long& mod) {
  long long numerator = 1;
  long long denominator = 1;
  for (int i = 0; i < static_cast<int>(x); i++) {
    numerator *= (n - i) % mod;
    numerator %= mod;
    denominator *= (i + 1) % mod;
    denominator %= mod;
  }
  return div(numerator, denominator, mod);
}
map<int, vector<int>> result;
map<int, map<int, string>> result_str;
int find_k(const string& target, const int position, const string& prev) {
  if (position == target.size()) {
    return 0;
  }
  if (result.find(position) != result.end()) {
    int k = result[position][0];
    if (result_str[position][k] != prev) {
      return k;
    }
    if (result[position].size() != 1) {
      return result[position][1];
    }
  }
  int candidate_k = -target.size();
  for (int i = 0; i < target.size() - position; ++i) {
    string sub = target.substr(position, i + 1);
    int child_k = find_k(target, position + i + 1, sub) + 1;
    if (result[position].size() == 0) {
      result[position].push_back(child_k);
      result[position].push_back(child_k);
      result_str[position][0] = sub;
      result_str[position][1] = sub;
    }
    if (result[position][0] < child_k) {
      result[position][1] = result[position][0];
      result_str[position][1] = result_str[position][0];
      result[position][0] = child_k;
      result_str[position][0] = sub;
    } else if (result[position][1] < child_k) {
      result[position][1] = child_k;
      result_str[position][1] = sub;
    }
    if (prev == sub) {
      continue;
    }
    if (candidate_k < child_k) {
      candidate_k = child_k;
    }
  }
  return candidate_k;
}
int main() {
  string S;
  cin >> S;
  int k = find_k(S, 0, "");
  cout << k << endl;
  return 0;
}
