#include #include using namespace std; using namespace atcoder; typedef long long int ll; typedef long double ld; #define FOR(i,l,r) for(ll i=l;i=l;i--) #define RREP(i,n) RFOR(i,0,n) #define ALL(x) x.begin(),x.end() #define PA pair #define F first #define S second #define BS(A,x) binary_search(ALL(A),x) #define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin()) #define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin()) #define COU(A,x) (UB(A,x)-LB(A,x)) #define sz(c) ((ll)(c).size()) //#include //namespace mp=boost::multiprecision; //using Bint=mp::cpp_int; templateusing min_priority_queue=priority_queue,greater>; templateostream&operator<<(ostream&os,pair&p){os<istream&operator>>(istream&is,pair&p){is>>p.F>>p.S;return is;} templateostream&operator<<(ostream&os,vector&v){REP(i,sz(v))os<istream&operator>>(istream&is,vector&v){for(T&in:v)is>>in;return is;} templatebool chmax(T&a,T b){if(abool chmin(T&a,T b){if(b>H>>W; vector>ans(H,vector(W)); if(H%2==0&&W%2==0)REP(i,H)REP(j,W)ans[i][j]=1; else if(H%2==0)REP(i,H)REP(j,W-1)ans[i][j]=1; else if(W%2==0)REP(i,H-1)REP(j,W)ans[i][j]=1; else{ if(H==W)REP(i,H)REP(j,W){if(i!=j)ans[i][j]=1;} else if(H>W)REP(i,H)REP(j,W){if(min(i,W-1)!=j)ans[i][j]=1;} else REP(i,H)REP(j,W){if(min(j,H-1)!=i)ans[i][j]=1;} } ll s=0; REP(i,H)REP(j,W)s+=ans[i][j]; cout<