#include <iostream>
#include <algorithm>
#include <vector>
typedef long long ll;
using namespace std;

template <class T> void input(T& a){
    cin>>a;
}

int main(){
  int A,B,C;
  input(A);
  input(B);
  input(C);
  if((A*A+B*B)<C*C){
    cout <<"Yes"<<endl;
  }
  else{
    cout <<"No"<<endl;
  }

  return 0;
}

#include <bits/stdc++.h>
using namespace std;
 
#define fs(n) fixed << setprecision(n)
using ll = long long;
using ld = long double;

ll fact(ll x) { return x <= 1 ? 1 : x * fact(x - 1); }

//再帰処理で時間を食い過ぎるので階乗をメモ化する
map<ll, ll> factMemo;
ll memo_fact(ll x){
  if(factMemo[x] != 0) return factMemo[x];
  else return x <= 1 ? 1 : x * fact(x - 1);
}

int sign(int x){
  return (x > 0) - (x < 0);
}

bool isLeapYear(int y, int m){
  return (y % 400 == 0 || (y % 4 == 0 && y % 100)) && m == 2;
}
 
vector<int> AllDivs(int d){
	vector<int> resDivs(0);
	for(int i = 1; i < (int)sqrt(d); i++){
		if(d % i == 0){
			resDivs.push_back(i);
			resDivs.push_back(d / i);
		}
	}
	sort(resDivs.begin(), resDivs.end());
	return resDivs;
}
 
bool IsPrime(int num){
	bool ans = true;
	if(num < 2) return false;
	else if (num == 2) return true;
	else{
		for(int i = 2; i <= (int)sqrt(num); i++){
			if(num % i == 0){
					ans = false;
			}
		}
	}
	return ans;
}
 
int NextPrime(int d){
	int ans = d;
	while(true){
		ans++;
		if(IsPrime(ans)) break;
	}
	return ans;
}
 
vector<int> Dec2Bin(int x, int len){
	vector<int> res(len, 0);
	int d = 1, pt = len - 1;
	while(d <= x){
		res[pt] = (x & d ? 1 : 0);
		d *= 2; pt--;
	}
	return res;
}
 
int avg(int a, int b){
  return (a + b) / 2;
}

ll permu(ll m, ll c){
  ll ans = 1;
  for(ll i = c; i <= m; i++){
    ans *= i;
  }
  return ans;
}

ll combi(ll m, ll c){
  ll mf = memo_fact(c);
  factMemo[c] = mf;
  return (permu(m, c) / mf);
}

ll choose_two(ll m){
  return m * (m + 1) / 2;
}

ll gcd(ll a, ll b){
  if(b == 0) return a;
  else return gcd(b, a % b);
}

ll lcm(ll a, ll b){
  return a * b / gcd(a, b);
}


int main(){
  // 反転はフラグで先頭と末尾を切り替え
  string s; cin >> s;
  bool flg = true;
  string t = "";
  for(int i = 0; i < s.length(); i++){
    string u = s.substr(i, 1);
    if(u != "R"){
      if(t.length() == 0){
        t += u;
        continue;
      }
      if(flg){
        // 削除する
        if(t.substr(t.length() - 1, 1) == u){
          t.erase(t.length() - 1);
        }else t += u;
      }else{
        if(t.substr(0, 1) == u){
          t.erase(0, 1);
        }else t = u + t;
      }
    }else flg = !flg;
    // cout << t << endl;
  }
  if(!flg) reverse(t.begin(), t.end());
  cout << t << endl;
}