stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include <iostream>

using namespace std;

int main()

{

	long long a,b;cin>>a>>b;

	if(a>0&&b>0) cout<<"Positive";

	if((a<0&&b>0)||a==0||b==0) cout<<"Zero";

	if(a<0&&b<0) 

	{

		if((b-a+1)%2==0) cout<<"Positive";

		else cout<<"Negative";

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.298764928495077x):
#include<cstdio>

int l, r;

bool ans = true;

int main()

{

	scanf("%d%d",&l, &r);

	for(int i = l;i <= r;i++){

		if(i == 0){

			printf("Zero");

			return 0;

		}else if(i < 0){

			ans = !ans;

		}

	}

	if(ans > 0) printf("Positive");

	else printf("Negative");

	return 0;

}
// Slower C++ solution:
#include<iostream>

#include<cstdio>

using namespace std;

int main()

{

	long long a,b,s=0;

	cin>>a>>b;

	if(a>0 && b>0)

	{

		printf("Positive\n");

	}

	if(a<0 && b<0)

	{

		for(int i=a;i<=b;i++)

		{

			s++;

		}

		if(s%2==1)

		{

			printf("Negative\n");

		}

		if(s%2==0)

		{

			printf("Positive\n");

		}

	}

	if(a==0 || b==0 || (a<0 && b>0))		

	printf("Zero\n");

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.2861909001313085x):
#include<cstdio>

int l, r;

bool ans = true;

int main()

{

	scanf("%d%d",&l, &r);

	for(int i = l;i <= r;i++){

		if(i == 0){

			printf("Zero");

			return 0;

		}else if(i < 0){

			ans = !ans;

		}

	}

	if(ans > 0) printf("Positive");

	else printf("Negative");

	return 0;

}
// Slower C++ solution:
#include<iostream>

#include<cstdio>

using namespace std;

int a,b;

int main(){

    cin>>a>>b;

    if(a>0)puts("Positive");

    else if(b>=0)puts("Zero");

    else if((a&1)^(b&1))puts("Positive");

    else puts("Negative");

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.284830177668073x):
#include<cstdio>

int l, r;

bool ans = true;

int main()

{

	scanf("%d%d",&l, &r);

	for(int i = l;i <= r;i++){

		if(i == 0){

			printf("Zero");

			return 0;

		}else if(i < 0){

			ans = !ans;

		}

	}

	if(ans > 0) printf("Positive");

	else printf("Negative");

	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main(){

	int a,b;

	cin>>a>>b;

	if((a<=0&&b>=0)||(a>=0&&b<=0)){

		cout<<"Zero";

	}

	if(a>0&&b>0){

		cout<<"Positive";

	}

	if(a<0&&b<0){

		if((b-a)%2==1)cout<<"Positive";

		else cout<<"Negative";

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.298036927089692x):
#include<cstdio>

int l, r;

bool ans = true;

int main()

{

	scanf("%d%d",&l, &r);

	for(int i = l;i <= r;i++){

		if(i == 0){

			printf("Zero");

			return 0;

		}else if(i < 0){

			ans = !ans;

		}

	}

	if(ans > 0) printf("Positive");

	else printf("Negative");

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

long long int a,b,s;

int main()

{

    cin>>a>>b;

    if(a==0||b==0)

    {

    	cout<<"Zero"<<endl;

    	return 0;

	}

	if(a<0&&b<0)

	{

		s=b-a;

		if(s%2==0)

		{

			cout<<"Negative"<<endl;

		    return 0;

		}

		else

		{

			cout<<"Positive"<<endl;

    	    return 0;

		}

	}

	if(a<0&&b>0)

	{

		cout<<"Zero"<<endl;

    	return 0;

	} 

	if(a<0)

	{

		a=a*-1;

		if(a%2==0)

		{

			cout<<"Positive"<<endl;

    	    return 0;

		}

		else

		{

			cout<<"Negative"<<endl;

		    return 0;

		}

	}

	else

	{

		cout<<"Positive"<<endl;

		return 0;

	}

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.31307931195679x):
#include<cstdio>

int l, r;

bool ans = true;

int main()

{

	scanf("%d%d",&l, &r);

	for(int i = l;i <= r;i++){

		if(i == 0){

			printf("Zero");

			return 0;

		}else if(i < 0){

			ans = !ans;

		}

	}

	if(ans > 0) printf("Positive");

	else printf("Negative");

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int a,b;

int c=0,d=0;

int main() {

	cin>>a>>b;



	for(int i=a; i<=b; i++) {

		if(i==0) {

			cout<<"Zero"<<endl;

			return 0;

		}

		if(i<0) {

			c++;

		}

		if(i>0) {

			d++;

		}

	}

	if(c%2==0) {

		cout<<"Positive"<<endl;

		return 0;

	} else {

		cout<<"Negative"<<endl;

		return 0;

	}

	if(c==0) {

		cout<<"Positive"<<endl;

		return 0;

	}

}

// Faster C++ solution for the same problem (measured speedup: 5.273012437062865x):
#include<cstdio>

int l, r;

bool ans = true;

int main()

{

	scanf("%d%d",&l, &r);

	for(int i = l;i <= r;i++){

		if(i == 0){

			printf("Zero");

			return 0;

		}else if(i < 0){

			ans = !ans;

		}

	}

	if(ans > 0) printf("Positive");

	else printf("Negative");

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

string x="Positive\n",y="Negative\n",z="Zero\n";

inline int read(){

    int X=0,w=0; char ch=0;

    while(!isdigit(ch)) {w|=ch=='-';ch=getchar();}

    while(isdigit(ch)) X=(X<<3)+(X<<1)+(ch^48),ch=getchar();

    return w?-X:X;

}

inline void write(int x){

     if(x<0) putchar('-'),x=-x;

     if(x>9) write(x/10);

     putchar(x%10+'0');

}

int main(){

	int a=read(),b=read();

	if(a<=0&&b>=0)

		cout<<z;

	else if(a>0&&b>0)

		cout<<x;

	else if(a<0&&b<0){

		int s=abs(a-b)+1;

		if(s%2)

		cout<<y;

		else cout<<x;

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.278687572762921x):
#include<cstdio>

int l, r;

bool ans = true;

int main()

{

	scanf("%d%d",&l, &r);

	for(int i = l;i <= r;i++){

		if(i == 0){

			printf("Zero");

			return 0;

		}else if(i < 0){

			ans = !ans;

		}

	}

	if(ans > 0) printf("Positive");

	else printf("Negative");

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

	long long a,b,shabi;

	cin>>a>>b;shabi=b-a+1;

	if(a>0)

	{

		cout<<"Positive";

		return 0;

	}

	if((a<0&&b>=0))

	{

		cout<<"Zero";

		return 0;

	}

	if(a<0&&b<0&&shabi%2==1)

	{

		cout<<"Negative";return 0;

	}

	cout<<"Positive";

 } 

// Faster C++ solution for the same problem (measured speedup: 5.2988274562231465x):
#include<cstdio>

int l, r;

bool ans = true;

int main()

{

	scanf("%d%d",&l, &r);

	for(int i = l;i <= r;i++){

		if(i == 0){

			printf("Zero");

			return 0;

		}else if(i < 0){

			ans = !ans;

		}

	}

	if(ans > 0) printf("Positive");

	else printf("Negative");

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

	int n,m;

	cin>>n>>m;

	bool flag=true;

	for(int i=n;i<=m;++i)

	{

		if(i<0)

		{

			if(flag)

				flag=false;

			else

				flag=true;

		}

		if(i==0)

		{

			cout<<"Zero"<<endl;

			return 0;

		}

	}

	if(flag)

		cout<<"Positive"<<endl;

	else

		cout<<"Negative"<<endl;

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.3135691124933375x):
#include<cstdio>

int l, r;

bool ans = true;

int main()

{

	scanf("%d%d",&l, &r);

	for(int i = l;i <= r;i++){

		if(i == 0){

			printf("Zero");

			return 0;

		}else if(i < 0){

			ans = !ans;

		}

	}

	if(ans > 0) printf("Positive");

	else printf("Negative");

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int a,b;

int main(){

    cin>>a>>b;

    if(a>0)

        cout<<"Positive";

    else if(a==0||(a<0&&b>0))

        cout<<"Zero";

    else if((abs(b)-abs(a))%2!=0)

        cout<<"Positive";

    else

        cout<<"Negative";

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.2583943474933825x):
#include<cstdio>

int l, r;

bool ans = true;

int main()

{

	scanf("%d%d",&l, &r);

	for(int i = l;i <= r;i++){

		if(i == 0){

			printf("Zero");

			return 0;

		}else if(i < 0){

			ans = !ans;

		}

	}

	if(ans > 0) printf("Positive");

	else printf("Negative");

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

    int a,b,s=1;

    cin>>a>>b;

    for(int i=a;i<=b;i++)

    {  

      if(i<0)s*=-1;

      if(i==0){cout<<"Zero"<<endl;return 0;} 

      

    }

    if(s>0)cout<<"Positive"<<endl;

    if(s<0)cout<<"Negative"<<endl;

    if(s==0)cout<<"Zero"<<endl;

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.314166103420862x):
#include<cstdio>

int l, r;

bool ans = true;

int main()

{

	scanf("%d%d",&l, &r);

	for(int i = l;i <= r;i++){

		if(i == 0){

			printf("Zero");

			return 0;

		}else if(i < 0){

			ans = !ans;

		}

	}

	if(ans > 0) printf("Positive");

	else printf("Negative");

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

long long a,b;



int main(){

    cin>>a>>b;

    if(a>0)cout<<"Positive";

    else if(a==0||(a<0&&b>0))cout<<"Zero";

    else if((abs(b)-abs(a))%2!=0)cout<<"Positive";

    else cout<<"Negative";

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.298867652619763x):
#include<cstdio>

int l, r;

bool ans = true;

int main()

{

	scanf("%d%d",&l, &r);

	for(int i = l;i <= r;i++){

		if(i == 0){

			printf("Zero");

			return 0;

		}else if(i < 0){

			ans = !ans;

		}

	}

	if(ans > 0) printf("Positive");

	else printf("Negative");

	return 0;

}
// Slower C++ solution:
# include <iostream>

# include <cstdio>

# include <cstring>

# include <iomanip>

# include <algorithm>

# include <cstdlib>

# include <cmath>

using namespace std;

int main()

{

	int a, b;

	cin >> a >> b;

	if (a > 0 && b > 0) cout << "Positive" << endl;

	if (a < 0 && b > 0) cout << "Zero" << endl;

	if (a < 0 && b < 0)

	{

		int c = 0;

		for (int i = a; i <= b; i++)

		{

			c++;

		}

		if (c % 2 == 0) cout << "Positive" << endl;

		else cout << "Negative"<< endl;

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.3270722652547295x):
#include<cstdio>



int main(){

    int A,B;

    scanf("%d%d",&A,&B);

    if(A<=0&&B>=0)

        puts("Zero");

    else if(A>0||(B-A)&1)

        puts("Positive");

    else

        puts("Negative");

}
// Slower C++ solution:
#include<bits/stdc++.h>



using namespace std;



long long a , b;



int main()

{

	cin >> a >> b;

	if((a == 0 || b == 0) || (a < 0 && b > 0))

	{

		cout << "Zero";

		return 0;

	}

	if(a > 0)

	{

		cout << "Positive";

		return 0;

	}

	if(b < 0)

	{

		if((abs(abs(a) - abs(b)) + 1) % 2)

		{

			cout << "Negative";

			return 0;

		}

		else

		{

			cout << "Positive";

			return 0;

		}

	}

	if(abs(a) % 2)

	{

		cout << "Negative";

		return 0;

	}

	else

	{

		cout << "Positive";

		return 0;

	}

}

// Faster C++ solution for the same problem (measured speedup: 5.3128598447247155x):
#include<cstdio>



int main(){

    int A,B;

    scanf("%d%d",&A,&B);

    if(A<=0&&B>=0)

        puts("Zero");

    else if(A>0||(B-A)&1)

        puts("Positive");

    else

        puts("Negative");

}
// Slower C++ solution:
#include <iostream>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <cmath>

#include <algorithm>

#include <queue>

#include <set>



using namespace std;

typedef pair<int,int> P;

typedef long long int ll;



int main()

{

    int a, b, i;

    scanf("%d %d", &a, &b);

    if(a <= 0 && b>=0)

    {

        printf("Zero\n");



    }

    else if(a > 0)

    {

        printf("Positive\n");

    }

    else

    {

        int t;

        if(b > 0)

            t = 0 - a;

        else

            t = b - a + 1;

        if(t % 2 == 0)

            printf("Positive\n");

        else

            printf("Negative\n");

    }

}

// Faster C++ solution for the same problem (measured speedup: 5.2383011243171875x):
#include<cstdio>

#include<algorithm>

using namespace std;

int main(void)

{

	long long int a,b;

	while(scanf("%lld%lld",&a,&b)!=EOF)

	{

		if(a>0&&b>0)

		printf("Positive\n");

		else if(a<0&&b>0)

		printf("Zero\n");

		else if(a==0||b==0)

		printf("Zero\n");

		else  if(a<0&&b<0)

		{

			if((b-a+1)%2==0)

			printf("Positive\n");

			else

			printf("Negative\n");

		}

		

	}

	return 0;

}
// Slower C++ solution:
#include<iostream>

#include<cmath>

#include<cstdio>

#include<cstring>

#include<cstdlib>

#include<algorithm>

#include<vector>

using namespace std;

int main()

{

	int a,b,sum=0;

	cin>>a>>b;

	if(a>0&&b>0)

	{

		cout<<"Positive"<<endl;;

		return 0;

	}

	if(a<0&&b<0)

	{

		for(int i=a;i<=b;i++)

			sum++;

		if(sum%2!=0)

			cout<<"Negative"<<endl;

		else

			cout<<"Positive"<<endl;

		return 0;

	}

	if(a<=0&&b>=0)

	{

		cout<<"Zero"<<endl;;

		return 0;

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.3052306868946655x):
#include<cstdio>

using namespace std;

int main(){

    int a,b;

    scanf("%d%d",&a,&b);

    if(a>0)

        printf("Positive");             

    else if(b>=0)

        printf("Zero");          

    else if((a&1)^(b&1))

        printf("Positive");

    else 

        printf("Negative");

    return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int n,m,sum;

int main() {

	cin>>n>>m;

	if(n<0&&m<0&&n!=m){

		sum=m-n+1;

		if(sum%2==1)

			cout<<"Negative"<<endl;

		else

			cout<<"Positive"<<endl;

	}

	if(n<0&&m>0){

		cout<<"Zero"<<endl;

		return 0;

	}

	if(n>0&&m>0){

		cout<<"Positive"<<endl;

		return 0;

	}

	if(n==0||m==0){

		cout<<"Zero"<<endl;

		return 0;

	}

	if(n>0&&n==m){

		cout<<"Positive"<<endl;

		return 0;

	}

	if(n==0&&n==m){

		cout<<"Zero"<<endl;

		return 0;

	}

	if(n<0&&n==m)

		cout<<"Negative"<<endl;

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.305541391331495x):
#include<cstdio>

using namespace std;

int main(){

    int a,b;

    scanf("%d%d",&a,&b);

    if(a>0)

        printf("Positive");             

    else if(b>=0)

        printf("Zero");          

    else if((a&1)^(b&1))

        printf("Positive");

    else 

        printf("Negative");

    return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;int main(){int a,b;cin>>a>>b;if(a>0)cout<<"Positive"<<endl;else if(b>=0)cout<<"Zero"<<endl;else if((a&1)^(b&1))cout<<"Positive"<<endl;/*^Òì»ò*/ else cout<<"Negative"<<endl;;return 0;}

// Faster C++ solution for the same problem (measured speedup: 5.306558242215664x):
#include<cstdio>

using namespace std;

int main(){

    int a,b;

    scanf("%d%d",&a,&b);

    if(a>0)

        printf("Positive");             

    else if(b>=0)

        printf("Zero");          

    else if((a&1)^(b&1))

        printf("Positive");

    else 

        printf("Negative");

    return 0;

}
// Slower C++ solution:
//

//  main.cpp

//  at1995

//

//  Created by horse on 2019/4/8.

//  Copyright © 2019 horse. All rights reserved.

//



#include <iostream>

using namespace std;

int main() {

    long long a,b;

    cin>>a>>b;

    if(a>0 && b>0) cout<<"Positive"<<endl;

    else if(a<=0 && b>=0) cout<<"Zero"<<endl;

    else{

        long long negnum=0;

        for(long long i=a;i<=b;i++)

        {

            if(i<0) negnum++;

        }

        if(negnum%2==0) cout<<"Positive"<<endl;

        else cout<<"Negative"<<endl;

    }

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.305865475385222x):
#include<cstdio>

using namespace std;

int main(){

    int a,b;

    scanf("%d%d",&a,&b);

    if(a>0)

        printf("Positive");             

    else if(b>=0)

        printf("Zero");          

    else if((a&1)^(b&1))

        printf("Positive");

    else 

        printf("Negative");

    return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

	int n,m;

	cin>>n>>m;

	int t=m-n+1;

	if(n>0)

	{

		cout<<"Positive"<<'\n';

		return 0;

	}

	if(n<=0&&m>=0)

	{

		cout<<"Zero"<<"\n";

		return 0;

	}

	if(n<0&&m<0&&t%2==1)

    {

        cout<<"Negative"<<'\n';

        return 0;

    }

	cout<<"Positive"<<'\n';

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.287648383667948x):
#include<cstdio>

using namespace std;

int main(){

    int a,b;

    scanf("%d%d",&a,&b);

    if(a>0)

        printf("Positive");             

    else if(b>=0)

        printf("Zero");          

    else if((a&1)^(b&1))

        printf("Positive");

    else 

        printf("Negative");

    return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int a,b;

int main(){

    cin>>a>>b;

    if(a>0)cout<<"Positive";

    else if(a==0||(a<0&&b>0))cout<<"Zero";

    else if((abs(b)-abs(a))%2!=0)cout<<"Positive";

    else cout<<"Negative";

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.250866330194079x):
#include<cstdio>

using namespace std;

int main(){

    int a,b;

    scanf("%d%d",&a,&b);

    if(a>0)

        printf("Positive");             

    else if(b>=0)

        printf("Zero");          

    else if((a&1)^(b&1))

        printf("Positive");

    else 

        printf("Negative");

    return 0;

}
// Slower C++ solution:
#include"bits/stdc++.h"

using namespace std;

int a,b;

int main(){

    cin>>a>>b;

    if(a>0)cout<<"Positive";

    else if(a==0||(a<0&&b>0))cout<<"Zero";

    else if((abs(b)-abs(a))%2!=0)cout<<"Positive";

    else cout<<"Negative";

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.250866330194079x):
#include<cstdio>

using namespace std;

int main(){

    int a,b;

    scanf("%d%d",&a,&b);

    if(a>0)

        printf("Positive");             

    else if(b>=0)

        printf("Zero");          

    else if((a&1)^(b&1))

        printf("Positive");

    else 

        printf("Negative");

    return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main(){

	signed long long a,b,c=0,d=0;

	cin>>a>>b;

	for(signed long long i=a;i<=b;i++){

		if(i<0){

			c++;

		}

		if(i==0){

			d=1;

		}

	}

	if(d==1){

		cout<<"Zero"<<endl;

	}else{

		if(c%2==0){

			cout<<"Positive"<<endl;

		}else{

			cout<<"Negative"<<endl;

		}

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.305865475385222x):
#include<cstdio>

using namespace std;

int main(){

    int a,b;

    scanf("%d%d",&a,&b);

    if(a>0)

        printf("Positive");             

    else if(b>=0)

        printf("Zero");          

    else if((a&1)^(b&1))

        printf("Positive");

    else 

        printf("Negative");

    return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int a,b;

int main() {

	ios::sync_with_stdio(false);

	cin >> a >> b;

	if(a <= 0 && b >= 0)

		cout << "Zero\n";

	else if(a > 0 || abs(b) - abs(a) & 1)

		cout << "Positive\n";

	else

		cout << "Negative\n";

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.324384351794727x):
#include<cstdio>

using namespace std;

int main(){

    int a,b;

    scanf("%d%d",&a,&b);

    if(a>0)

        printf("Positive");             

    else if(b>=0)

        printf("Zero");          

    else if((a&1)^(b&1))

        printf("Positive");

    else 

        printf("Negative");

    return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int a,b;

int main()

{

    cin>>a>>b;

    if(a>0)cout<<"Positive";

    else if(a==0||(a<0&&b>0))cout<<"Zero";

    else if((abs(b)-abs(a))%2!=0)cout<<"Positive";

    else cout<<"Negative";

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.250866330194079x):
#include<cstdio>

using namespace std;

int main(){

    int a,b;

    scanf("%d%d",&a,&b);

    if(a>0)

        printf("Positive");             

    else if(b>=0)

        printf("Zero");          

    else if((a&1)^(b&1))

        printf("Positive");

    else 

        printf("Negative");

    return 0;

}
// Slower C++ solution:
#include<map>

#include<cmath>

#include<stack>

#include<queue>

#include<cstdio>

#include<vector>

#include<cstring>

#include<iostream>

#include<algorithm>

using namespace std;

typedef long long ll;

int a,b;

int main(){

    scanf("%d%d",&a,&b);

    if(a>0&&b>0)puts("Positive");

    else if(max(a,b)>=0&&min(a,b)<=0)puts("Zero");

    else if((abs(max(a,b))-abs(min(a,b)))%2==0)puts("Negative");

    else puts("Positive");

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.258925171754215x):
#include<cstdio>

using namespace std;

int a,b;

int main(){

    scanf("%d%d",&a,&b);

    if(a>0)puts("Positive");             

    else if(b>=0)puts("Zero");             

    else if((a&1)^(b&1))puts("Positive");  

    else puts("Negative");

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

    int a,b;

    cin>>a>>b;

    if(a>0)

    {

        cout<<"Positive";  

    }

    else if(b>=0)

    {

        cout<<"Zero";  

    }

    else if((a&1)^(b&1))

    {

        cout<<"Positive";  

    }

    else 

    {

        cout<<"Negative";

    }

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.3143285048536155x):
#include<cstdio>

using namespace std;

int a,b;

int main(){

    scanf("%d%d",&a,&b);

    if(a>0)puts("Positive");             

    else if(b>=0)puts("Zero");             

    else if((a&1)^(b&1))puts("Positive");  

    else puts("Negative");

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int a,b;

int main(){

    scanf("%d%d",&a,&b);

    if(a>0)puts("Positive");               

    else if(b>=0)puts("Zero");            

    else if((a&1)^(b&1))puts("Positive");  

    else puts("Negative");

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.259394033510177x):
#include<cstdio>

using namespace std;

int a,b;

int main(){

    scanf("%d%d",&a,&b);

    if(a>0)puts("Positive");             

    else if(b>=0)puts("Zero");             

    else if((a&1)^(b&1))puts("Positive");  

    else puts("Negative");

}
// Slower C++ solution:
#include<iostream>

#include<iomanip>

#include<cstring>

#include<cstdio>

#include<cmath>

#include<algorithm>

#include<set>

#include<map>

using namespace std;

int main() {

    int a,b,ans=0;

    cin>>a>>b;

    if(a<=0&&b>=0){puts("Zero");return 0;}

	for(int i=a;i<=b;i++)

	  ans+=i<0?1:0;

	if(ans%2==1)puts("Negative");

	else puts("Positive");

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.301552768598805x):
#include<cstdio>

using namespace std;

int a,b;

int main(){

    scanf("%d%d",&a,&b);

    if(a>0)puts("Positive");             

    else if(b>=0)puts("Zero");             

    else if((a&1)^(b&1))puts("Positive");  

    else puts("Negative");

}
// Slower C++ solution:
#include<map>

#include<cmath>

#include<stack>

#include<queue>

#include<cstdio>

#include<vector>

#include<cstring>

#include<iostream>

#include<algorithm>

using namespace std;

typedef long long ll;

int a,b;

int main(){

    scanf("%d%d",&a,&b);

    if(a>0&&b>0)puts("Positive");

    else if(max(a,b)>=0&&min(a,b)<=0)puts("Zero");

    else if((abs(max(a,b))-abs(min(a,b)))%2==0)puts("Negative");

    else puts("Positive");

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.258925171754215x):
#include<cstdio>

using namespace std;

int a,b;

int main(){

    scanf("%d%d",&a,&b);

    if(a>0)puts("Positive");               //情况1

    else if(b>=0)puts("Zero");             //情况2

    else if((a&1)^(b&1))puts("Positive"); 

    else puts("Negative");



}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

    int a,b;

    cin>>a>>b;

    if(a>0)

    {

        cout<<"Positive";  

    }

    else if(b>=0)

    {

        cout<<"Zero";  

    }

    else if((a&1)^(b&1))

    {

        cout<<"Positive";  

    }

    else 

    {

        cout<<"Negative";

    }

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.3143285048536155x):
#include<cstdio>

using namespace std;

int a,b;

int main(){

    scanf("%d%d",&a,&b);

    if(a>0)puts("Positive");               //情况1

    else if(b>=0)puts("Zero");             //情况2

    else if((a&1)^(b&1))puts("Positive"); 

    else puts("Negative");



}