Problem: A substring of a string is a contiguous subsequence of that string. So, string bca is substring of string abcabc, but string cc is not.

A repeating block is a string formed by concatenating some string with itself. So, string abcabc is a repeating block, but strings abcabd, ababab are not.

You've got a sequence of Latin characters (string). At each step you find the shortest substring that is a repeating block, if there exists more than one you must choose the leftmost. As the substring is of form XX (X — some string) you replace this substring with X, in other words you delete one of the X substrings in the substring. You repeat this process until there remains no repeating block in the string. 

How would the final string looks like? Look at the sample explanation to understand the statement more precise.

Input

In the first line of input you're given a string of small Latin characters with length between 1 to 50000, inclusive.

Output

Print the final string after applying changes.

Examples

Input

abccabc


Output

abc


Input

aaaabaaab


Output

ab


Input

birdbirdbirdistheword


Output

birdistheword

Note

At the first sample the string transforms as follows: abccabc →  abcabc →  abc.

At the second sample the string transforms as follows: aaaabaaab →  aaabaaab →  aabaaab →  abaaab →  abaab →  abab →  ab.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
template <class T>
void debug(T a, T b) {
  for (; a != b; ++a) cerr << *a << ' ';
  cerr << endl;
}
template <class T>
void chmin(T& a, const T& b) {
  if (a > b) a = b;
}
template <class T>
void chmax(T& a, const T& b) {
  if (a < b) a = b;
}
namespace std {
template <class S, class T>
ostream& operator<<(ostream& out, const pair<S, T>& a) {
  out << '(' << a.first << ',' << a.second << ')';
  return out;
}
}  // namespace std
template <long long int mod>
struct Int_ {
  unsigned x;
  int mpow(Int_ a, int k) {
    Int_ res = 1;
    while (k) {
      if (k & 1) res = res * a;
      a = a * a;
      k >>= 1;
    }
    return res.x;
  }
  int inverse(Int_ a) { return mpow(a, mod - 2); }
  Int_() : x(0) {}
  Int_(long long sig) {
    int sigt = sig % mod;
    if (sigt < 0) sigt += mod;
    x = sigt;
  }
  int get() const { return (int)x; }
  Int_& operator+=(Int_ that) {
    if ((x += that.x) >= mod) x -= mod;
    return *this;
  }
  Int_& operator-=(Int_ that) {
    if ((x += mod - that.x) >= mod) x -= mod;
    return *this;
  }
  Int_& operator*=(Int_ that) {
    x = (unsigned long long)x * that.x % mod;
    return *this;
  }
  Int_& operator=(Int_ that) {
    x = that.x;
    return *this;
  }
  Int_& operator/=(Int_ that) {
    x = (unsigned long long)x * inverse(that.x) % mod;
    return *this;
  }
  bool operator==(Int_ that) const { return x == that.x; }
  bool operator!=(Int_ that) const { return x != that.x; }
  Int_ operator-() const { return Int_(0) - Int_(*this); }
  Int_ operator+(Int_ that) const { return Int_(*this) += that; }
  Int_ operator-(Int_ that) const { return Int_(*this) -= that; }
  Int_ operator*(Int_ that) const { return Int_(*this) *= that; }
  Int_ operator/(Int_ that) const { return Int_(*this) /= that; }
};
namespace std {
template <long long int mod>
ostream& operator<<(ostream& out, const Int_<mod>& a) {
  out << a.get();
  return out;
}
template <long long int mod>
istream& operator>>(istream& in, Int_<mod>& a) {
  in >> a.x;
  return in;
}
};  // namespace std
char s[50005];
int n;
Int_<1000000021> sum[50005], pw1[50005];
Int_<1000000009> sum2[50005], pw2[50005];
bool cmp(int i, int j, int len) {
  if (sum[i + len] - sum[i] * pw1[len] == sum[j + len] - sum[j] * pw1[len] &&
      sum2[i + len] - sum2[i] * pw2[len] == sum2[j + len] - sum2[j] * pw2[len])
    return true;
  return false;
}
int getlcp(int i, int j) {
  int lb = 0, ub = n - max(i, j) + 1;
  while (ub - lb > 1) {
    int md = (lb + ub) >> 1;
    if (cmp(i, j, md))
      lb = md;
    else
      ub = md;
  }
  return lb;
}
int getlcs(int i, int j) {
  int lb = 0, ub = min(i, j);
  while (ub - lb > 1) {
    int md = (lb + ub) >> 1;
    if (cmp(i - md, j - md, md))
      lb = md;
    else
      ub = md;
  }
  return lb;
}
bool check(int L) {
  for (int i = 0; i + L <= n; i += L) {
    if (getlcp(i, i + L) + getlcs(i, i + L) >= L) {
      return true;
    }
  }
  return false;
}
const int P = 100000007;
void init() {
  sum[0] = 0;
  sum2[0] = 0;
  for (int i = 0; i < (n); ++i) {
    sum[i + 1] = (sum[i] * P) + (s[i]);
    sum2[i + 1] = sum2[i] * P + s[i];
  }
}
void del(int L) {
  int m = L, same = 0;
  for (int i = m; i < n; ++i) {
    if (s[i] == s[m - L])
      ++same;
    else
      same = 0;
    if (same == L) {
      m -= L;
      same = 0;
    }
    s[m++] = s[i];
  }
  n = m;
  s[m] = '\0';
  init();
}
int main() {
  scanf("%s", s);
  n = strlen(s);
  pw1[0] = 1;
  pw2[0] = 1;
  for (int i = 0; i < (n); ++i) {
    pw1[i + 1] = pw1[i] * P;
    pw2[i + 1] = pw2[i] * P;
  }
  init();
  for (int i = 1; i * 2 <= n; ++i) {
    if (check(i)) {
      del(i);
    }
  }
  cout << s << endl;
  return 0;
}