#include <bits/stdc++.h>
using namespace std;
const int inf = 0x20202020;
const int mod = 1000000007;
template <class T>
inline void read(T& x) {
  bool fu = 0;
  char c;
  for (c = getchar(); c <= 32; c = getchar())
    ;
  if (c == '-') fu = 1, c = getchar();
  for (x = 0; c > 32; c = getchar()) x = x * 10 + c - '0';
  if (fu) x = -x;
};
template <class T>
inline void read(T& x, T& y) {
  read(x);
  read(y);
}
template <class T>
inline void read(T& x, T& y, T& z) {
  read(x);
  read(y);
  read(z);
}
template <class T>
inline void read(T& x, T& y, T& z, T& q) {
  read(x);
  read(y);
  read(z);
  read(q);
}
const int DX[] = {1, 0, -1, 0}, DY[] = {0, 1, 0, -1};
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= mod;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
long long powmod(long long a, long long b, long long mod) {
  long long res = 1;
  a %= mod;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
const int N = 55555, M = 111111;
int l, m, n, t, C;
char s[N], tmp[N];
int main() {
  scanf("%s", s + 1);
  n = strlen(s + 1);
  for (int _tmp = n >> 1, l = 1; l <= _tmp; ++l) {
    int cnt = 0, tot = 0, ans = 0;
    for (int _tmp = n - l, i = 1; i <= _tmp; ++i) {
      if (s[i] == s[i + l])
        cnt++;
      else
        cnt = 0;
      if (cnt >= l) {
        ans = i;
        break;
      }
    }
    if (ans) {
      for (int _tmp = n - l, i = ans; i <= _tmp; ++i) s[i] = s[i + l];
      n -= l;
      l--;
    }
  }
  s[n + 1] = 0;
  printf("%s\n", s + 1);
  return 0;
}
