program vijos1134;
var
a:array[1..4] of longint;
head,i,j,k,l,ans:longint;
p:string;
pan:boolean;
procedure dfs(s:real;a,b,c,d,e:longint);
begin
if (e<=0) then
begin if (s=24) then begin ans:=1; writeln(ans); halt; end; exit; end;
dfs(s+a,b,c,d,0,e-1);
dfs(s-a,b,c,d,0,e-1);
dfs(s*a,b,c,d,0,e-1);
dfs(s/a,b,c,d,0,e-1);
if (e>=2) then dfs(s*(a+b),c,d,0,0,e-2);
if (e>=2) then dfs(s*(a-b),c,d,0,0,e-2);
if (e>=2) then dfs(s/(a+b),c,d,0,0,e-2);
if (a-b<>0) then dfs(s/(a-b),c,d,0,0,e-2);
if (e=4) then dfs(s+a*b-c*d,0,0,0,0,e-4);
if (e=4) then dfs(s+a*b-c/d,0,0,0,0,e-4);
if (e=4) then dfs(s+a*b+c/d,0,0,0,0,e-4);
if (e=4) then dfs(s+a*b+c*d,0,0,0,0,e-4);
end;

begin
readln(p);
head:=0;
for i:=1 to length(p) do
case p[i] of
'A': begin inc(head); a[head]:=1; end;
'2','3','4','5','6','7','8','9': begin inc(head); a[head]:=ord(p[i])-ord('0'); end;
'1': begin inc(head); a[head]:=10; end;
'0',' ':continue;
'J': begin inc(head); a[head]:=11; end;
'Q': begin inc(head); a[head]:=12; end;
'K': begin inc(head); a[head]:=13; end;
end;
ans:=0;
for i:=1 to 4 do for j:=1 to 4 do for k:=1 to 4 do for l:=1 to 4 do
if (i<>j) and (j<>k) and (k<>l) and (i<>k) and (i<>l) and (j<>l) then
dfs(0,a[i],a[j],a[k],a[l],4);
writeln(ans);
end.