Problem:
Score : 100 points

Problem Statement

You are given integers A and B, each between 1 and 3 (inclusive).

Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number.

Constraints

All values in input are integers.

1 \leq A, B \leq 3

Input

Input is given from Standard Input in the following format:

A B

Output

If there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.

Sample Input 1

3 1

Sample Output 1

Yes

Let C = 3. Then, A \times B \times C = 3 \times 1 \times 3 = 9, which is an odd number.

Sample Input 2

1 2

Sample Output 2

No

Sample Input 3

2 2

Sample Output 3

No

Solution in Pascal (FPC 2.6.2) (judge verdict: Wrong Answer)

program Project1;
     
{$APPTYPE CONSOLE}
     
uses
  SysUtils;
var
  a,h,w,i,j,count,x,y,sw,m,n,b,c,soeji,sum,max,k,min:Integer;
  l:array of string;
  s,s123,s1,s2,s3:string;
  al:string = 'abcdefghijklmnopqrstuvwxyz';
  tf,tfl,tfr:Boolean;
begin
  try
    { TODO -oUser -cConsole メイン : ここにコードを記述してください }
    Readln(a);
    count:=0;
    max  :=0;
    min  :=100;

    if a=2 then begin
      Writeln('No');
      Readln;
      exit;
    end;
    
    SetLength(l,a);
    for i := 0 to a-1 do begin
      Readln(l[i]);
      if not((i=0)or(i=a-1)) then begin
        if l[i-1][Length(l[i-1])]<>l[i][1] then begin
          //Writeln(l[i-1][Length(l[i-1])]);
          //Writeln(l[i][1]);
          Writeln('No');
          Readln;
          exit;
        end;     
      end;
    end;

    for i := 0 to a - 2 do
      for j := i to a - 2 do begin
        if l[i]=l[j+1] then begin
          Writeln('No');
          Readln;
          exit;
        end;
      end;

    Writeln('Yes');
    Readln;
  except
    on E: Exception do
      Writeln(E.ClassName, ': ', E.Message);
  end;
end.