#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;

int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }

int main() {
  string s;
  cin >> s;
  string ans;
  rep(i, s.size()) {
    if (ans.empty() || ans.back() != s[i]) ans += s[i];
  }
  cout << ans << endl;
  return 0;
}