output_description: If the product is positive, print `Positive`. If it is negative, print
  `Negative`. If it is zero, print `Zero`.
  
  * * *
input_description: The input is given from Standard Input in the following format:
  
      
      
      a b
attempt: #include <bits/stdc++.h>
  using namespace std;
  typedef long long ll;
  typedef unsigned long long ull;
  typedef vector<ll> vll;
  typedef vector<vll> vvll;
  typedef vector<vvll> vvvll;
  typedef vector<string> vstr;
  typedef pair<ll, ll> pll;
  typedef vector<pll> vp;
  typedef map<ll, ll> mll;
  typedef map<string, ll> mstrll;
  #define pb push_back
  #define mp make_pair
  #define fir first
  #define sec second
  #define maxs(x, y) (x = max(x, y))
  #define mins(x, y) (x = min(x, y))
  #define all(x) begin(x), end(x)
  #define rall(x) rbegin(x), rend(x)
  #define _overload3(_1, _2, _3, name, ...) name
  #define _rep(i, n) repi(i, 0, n)
  #define repi(i, a, b) for(ll i = ll(a); i < ll(b); i++)
  #define rep(...) _overload3(__VA_ARGS__, repi, _rep,)(__VA_ARGS__)
  #define each(i, n) for(auto&& i: n)
  #define out(x) cout << (x)
  #define indent() cout << '\n'
  #define print(x) cout << (x) << '\n'
  #define debug(x) cerr << #x << ": " << (x) << '\n'
  ll gcd(ll a, ll b){return b != 0 ? gcd(b, a % b) : a;}
  ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
  ll factorial(ll a){return a < 2 ? 1 : factorial(a - 1) * a;}
  ll summation(ll a){return a < 1 ? 0 : (a * a + a) / 2;}
  const ll INF = 1e16;
  const ll MOD = 1e9 + 7;
  const string ALPHABETS = "abcdefghijklmnopqrstuvwxyz";
  ll dx[] = {-1, 0, 1, 0}, dy[] = {0, -1, 0, 1};
  //ll dx[] = {-1, 0, 1, -1, 1, -1, 0, 1}, dy[] = {-1, -1, -1, 0, 0, 1, 1, 1};
  ll n, m, x, y, z, w, h;
  string s, t;
  
  signed main(){
      cin.tie(0);
      ios::sync_with_stdio(false);
      while(cin >> n >> m){
          ll ans = 0, tmp = 0, cnt = 0, mx = -INF, mn = INF;
          ll a[] = {}, b[] = {}, c[] = {};
          vll v;
          if(n * m <= 0){
              print("Zero");
          }else{
              if(n < 0){
                  print(abs(n - m) % 2 ? "Positive" : "Negative");
              }else{
                  print("Positive");
              }
          }
      }
  }
  
problem_description: Statement
  
  You are given two integers a and b (a≤b). Determine if the product of the
  integers a, a+1, …, b is positive, negative or zero.
samples: [{"input": "1 3", "output": "Positive\n    \n\n1\u00d72\u00d73=6 is positive.\n\n* * *"}, {"input": "-3 -1", "output": "Negative\n    \n\n(-3)\u00d7(-2)\u00d7(-1)=-6 is negative.\n\n* * *"}, {"input": "-1 1", "output": "Zero\n    \n\n(-1)\u00d70\u00d71=0."}]