// PascalABC.NET 3.1, сборка 1256 от 21.06.2016 function IsPrime(n:integer):boolean; begin if n<4 then Result:=True else begin var found:= (n mod 2 = 0); var p:=3; while (not found) and (sqr(p)<=n) do begin found:=(n mod p = 0); p+=2 end; Result:=not found end end;
begin Range(100,999).Where(n->IsPrime(n)).Println(',') end.
var a,b,c,count:integer; begin count:=0; readln (a,b,c); if (a mod 2=0) then count:=count+1; if (b mod 2=0) then count:=count+1; if (c mod 2=0) then count:=count+1; writeln (count); end.