#include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
#define pl pair<ll, ll>
#define pi pair<int, int>
#define minpq priority_queue<ll, vector<ll>, greater<ll>>
using namespace std;

#if 1
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '['; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "]";}
void _print() {cerr << endl << flush;}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "*["<<__LINE__<<"]\t"<< #x << " = "; _print(x)
#endif

const ll mod = 1e9 + 7;

template<typename T> bool chkmin(T &a, T b){return (b < a) ? a = b, 1 : 0;}
template<typename T> bool chkmax(T &a, T b){return (b > a) ? a = b, 1 : 0;}
ll gcd(ll a, ll b) {if(b == 0){return a;} return gcd(b, a % b);}

char tolower(char c){
	if (c >= 'a' && c <= 'z') return c;
	else return c - 'A' + 'a';
}

bool same(string s1, string s2){
	if (s1.size() != s2.size()) return false;
	for (int i = 0; i < s1.size(); i ++){
		char c1 = tolower(s1[i]);
		char c2 = tolower(s2[i]);
		if (c1 != c2) return false;
	}
	return true;
}

vector<string> simp(vector<string> a){
	int n = a.size();
	for (int i = 0; i < n - 3; i ++){
		if (same(a[i], a[i + 2])){
			vector<string> ans;
			for (int k = 0; k <= i; k ++) ans.push_back(a[k]);
			for (int k = i + 3; k < n; k ++) ans.push_back(a[k]);
			return ans;
		}
	}
	for (int i = 0; i < n - 2; i ++){
		if (same(a[i], a[i + 1])){
			vector<string> ans;
			for (int k = 0; k <= i; k ++) ans.push_back(a[k]);
			for (int k = i + 2; k < n; k ++) ans.push_back(a[k]);
			return ans;
		}
	}
	return a;
}
 
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	string s; cin >> s;
	int n = s.size();
	vector<string> a;
	int x = 0, len = 0;
	while(x < n){
		while(x + len < n && s[x + len] != '!') len ++;
		a.push_back(s.substr(x, len));
		x += len + 1; len = 0;
	}
	while(true){
		int orig = a.size();
		a = simp(a);
		if (a.size() == orig) break;
	}
	for (int i = 0; i < a.size() - 1; i ++) cout << a[i] << "!";
	cout << a.back();
}