一本通1054

//qf
#include <bits/stdc++.h>
#define f(i,j,n) for(register int i=j;i<=n;i++)
using namespace std;
typedef long long ll;
inline ll read() {
	ll x=0;
	int f=1;
	char ch=getchar();
	while(!isdigit(ch)) {
		if(ch=='-') f=-1;
		ch=getchar();
	}
	while(isdigit(ch)) x=(x<<1)+(x<<3)+(ch-48),ch=getchar();
	return x*f;
}
int a[4];
signed main() {
	f(i,1,3) a[i]=read();
	sort(a+1,a+3+1);
	puts((a[1]+a[2]>a[3])?"yes":"no");
	return 0;
}