#include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <optional>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

int main() {
    string s;
    cin >> s;
    string ans;
    ans.push_back(s.front());
    for (size_t i = 1; i < s.size(); ++i) {
        if (s[i - 1] != s[i])
            ans.push_back(s[i]);
    }
    cout << ans << endl;
    return 0;
}