program ss;

var all,i,j,k,n:integer;

a:array[1..10050]of integer;

procedure find(bit:integer;ch:char);

begin

if bit=n then begin all:=all+1; exit; end;

if ch='z' then find(bit+1,'s');

if ch='h' then find(bit+1,'l');

if ch='s' then begin find(bit+1,'z'); find(bit+1,'l'); end;

if ch='l' then begin find(bit+1,'s'); find(bit+1,'h'); end;

end;

begin

readln(n);

all:=0;

find(1,'z');

writeln(all);

end.

这个超时？？