#include<iostream>

using namespace std;

const int N=4;

int sun,num;

int i,j,k;

int n=N,m;

int a[N],b[N];

int sum[N];

void init()

{

int j1=0;

for(i=0;i<=n-2;i++) {

cin>>a[i];

if(a[i]=='A') {a[i]=1;} //A代替1，

if(a[i]=='J') {a[i]=11;} //J代替11，

if(a[i]=='Q') {a[i]=12;} //Q代替12，

if(a[i]=='K') {a[i]=13;} //K代替13;

}

for(i=0,j=0;i<=n,j<=n;i++,j++) {

b[j]=a[i]; }

sum[j1]=b[j]*b[j++]/b[j+2]+b[j+3]-b[n];

sum[j1++]=b[j]*b[j++]/b[j+2]-b[j+3]+b[n];

sum[j1+2]=b[j]/b[j++]*b[j+2]+b[j+3]-b[n];

sum[j1+3]=b[j]/b[j++]*b[j+2]-b[j+3]+b[n];

sum[j1+4]=(b[j]+b[j++]-b[j+2])*b[j+3]/b[n];

sum[j1+5]=(b[j]+b[j++]-b[j+2])/b[j+3]*b[n];

sum[j1+6]=(b[j]-b[j++]+b[j+2])*b[j+3]/b[n];

sum[j1+7]=(b[j]-b[j++]+b[j+2])/b[j+3]*b[n]; //比较麻烦；

for(j1=0;j1<=n;)

{

if(sum[j1]==24)

{cout<<"yes";

continue ;}

else

if(j1==n)

{cout<<"no";}

else {j1++;}

}

return ;

}

int main(void)

{

freopen("24.in","r",stdin);

freopen("24.out","w",stdout);

std::ios::sync_with_stdio(false);

init();

return 0;

}