#include <bits/stdc++.h>
using namespace std;
long long max(long long a, long long b) { return a >= b ? a : b; }
long long modularExponentiation(long long x, long long n, long long mm) {
  long long result = 1;
  while (n > 0) {
    if (n % 2 == 1) result = (result * x) % mm;
    x = (x * x) % mm;
    n = n / 2;
  }
  return result;
}
long long modInverse(long long A, long long mm) {
  return modularExponentiation(A, mm - 2, mm);
}
void solve() {
  string s;
  cin >> s;
  long long n = (long long)s.size();
  long long x = 0, y = 0;
  for (long long i = 0; i < n; i++) {
    x += s[i] == 'x';
    y += s[i] == 'y';
  }
  if (y > x) {
    long long t = y - x;
    for (long long i = 0; i < t; i++) cout << 'y';
  } else {
    long long t = x - y;
    for (long long i = 0; i < t; i++) cout << 'x';
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  while (t--) solve();
}
