var s:string;a:array[0..100]of string;i,j:longint;tot,x:longint;
procedure dfs(dep,last:longint;t:string);
var i:longint;
beginif dep>1 thenbegininc(tot);a[tot]:=t;end;for i:=last+1 to length(s) dodfs(dep+1,i,t+s[i]);
end;
beginreadln(s);dfs(1,0,'');for i:=1 to tot dobeginx:=0;for j:=1 to tot doif (a[i]=a[j])and(length(a[i])=length(a[j])) then inc(x);if x=2 thenbeginwriteln('Y');exit;end;end;writeln('N');
end.

varc:array['0'..'1']of longint;s:ansistring;n,i:longint;
beginreadln(s);n:=length(s);for i:=1 to n doinc(c[s[i]]);if (c['0']=2)or(c['1']=2) thenbeginwriteln('Y');exit;end;if n=2 thenbeginwriteln('N');exit;end;if (s[1]=s[2])and(s[2]<>s[3]) thenbeginwriteln('Y');exit;end;if (s[n]=s[n-1])and(s[n]<>s[n-2]) thenbeginwriteln('Y');exit;end;for i:=3 to n-1 doif (s[i]=s[i-1])and(s[i]<>s[i-2])and(s[i]<>s[i+1]) thenbeginwriteln('Y');exit;end;writeln('N');
end.

var n,m:longint;a,b,c:array[0..100]of longint;ans:int64;i:longint;
procedure dfs(dep,last:longint);
var i,j:longint;x:boolean;
beginif dep=m thenbeginx:=true;for j:=1 to m doif a[c[j]]+b[j]<a[c[j-1]]+b[j-1] thenbeginx:=false;break;end;if x then inc(ans);exit;end;for i:=last+1 to n dobeginc[dep+1]:=i;dfs(dep+1,i);end;
end;
beginread(n,m);for i:=1 to n doread(a[i]);for i:=1 to m doread(b[i]);dfs(0,0);writeln(ans);
end.

varn,m:longint;a,b:array[0..10000]of longint;i,j,k:longint;f:array[0..500,0..500]of longint;ans:int64;
beginread(n,m);for i:=1 to n doread(a[i]);for i:=1 to m doread(b[i]);for i:=1 to n dof[i,1]:=1;for i:=1 to n dobeginfor j:=2 to m dofor k:=1 to i-1 doif a[i]+b[j]>=a[k]+b[j-1] thenf[i,j]:=(f[i,j]+f[k,j-1]) mod 1000000007;end;for i:=1 to n doans:=(ans+f[i,m]) mod 1000000007;writeln(ans);
end.

var n,m,q:longint;i,j,k:longint;x,y,z:longint;c:array[0..1000]of longint;dist:array[0..350,0..350]of longint;min:longint;
function mn(a,b:longint):longint;
beginif a<b then exit(a) else exit(b);
end;
beginread(n,m,q);for i:=1 to q doread(c[i]);for i:=1 to n dofor j:=1 to n dodist[i,j]:=1 << 25;for i:=1 to m dobeginread(x,y,z);dist[x,y]:=mn(dist[x,y],z);dist[y,x]:=dist[x,y];end;for k:=1 to n dofor i:=1 to n dofor j:=1 to n doif dist[i,k]+dist[k,j]<dist[i,j] thendist[i,j]:=dist[i,k]+dist[k,j];min:=maxlongint;for i:=1 to q dofor j:=1 to q doif (i<>j) thenif dist[c[i],c[j]]<min then min:=dist[c[i],c[j]];writeln(min);
end.

typenode=recordy,z:longint;next:longint;end;
var  e:array[0..200050]of node;i,j:longint;dist,first,c:array[0..100050]of longint;x,y,z:longint;q:array[0..1000050]of longint;v:array[0..100050]of boolean;tot:longint;n,m,p:longint;min:longint;
procedure adde(x,y,z:longint);
begine[tot].next:=first[x];e[tot].y:=y;e[tot].z:=z;first[x]:=tot;inc(tot);
end;
procedure spfa(s:longint);
var head,tail:longint;i,now,y:longint;
beginhead:=1;tail:=1;for i:=1 to n dobegindist[i]:=1 << 25;v[i]:=false;end;q[1]:=s;v[s]:=true;dist[s]:=0;while head<=tail dobeginnow:=q[head];i:=first[now];while i<>-1 dobeginy:=e[i].y;if dist[y]>dist[now]+e[i].z thenbegindist[y]:=dist[now]+e[i].z;if not v[y] thenbegininc(tail);q[tail]:=y;v[y]:=true;end;end;i:=e[i].next;end;inc(head);v[now]:=false;end;
end;
beginread(n,m,p);for i:=1 to p doread(c[i]);for i:=1 to n dofirst[i]:=-1;for i:=1 to m dobeginread(x,y,z);adde(x,y,z);adde(y,x,z)end;min:=maxlongint;for i:=1 to p dobeginspfa(c[i]);for j:=1 to p doif (i<>j)and(dist[c[j]]<min) then min:=dist[c[j]];end;writeln(min);
end.