stablegradients/pie-gem5-bysrc huggingface dataset:
// Original C++ solution (slower):
#include <iostream>

#include <string>

#include <cstdio>

#include <cstdlib>



#define int long long



using namespace std;



const int SZ = 1e6;



int dp[SZ];



int32_t main()

{

    //freopen("input.txt", "r", stdin);

    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n;

    string s;

    cin >> n >> s;

    fill(dp, dp + SZ, 0);

    dp[0] = 0;

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

    {

        dp[i + 1] = max(dp[i + 1], dp[i]);

        dp[i + 2] = max(dp[i + 2], dp[i]);

        if (s[i] == '1' || i == 0 || i == n - 1) continue;

        if (s[i-1] != '1' || s[i + 1] != '1') continue;

        int i1 = i - 1, i2 = i + 1;

        while (s[i1] == '1' && i1 >= 0)

            i1--;

        while (s[i2] == '1' && i2 < n)

            i2++;

        for (int j = i1 + 1; j < i; j++)

            dp[i + 2] = max(dp[i + 2], i - j + dp[j]);

        for (int j = i2 - 1; j > i; j--)

            dp[j + 1] = max(dp[j + 1], j - i + dp[i - 1]);

    }

    cout << dp[n] << endl;

}

// Optimized solution to the same problem (faster):
#include <iostream>

#include <string>

#include <cstdio>

#include <cstdlib>

 

using namespace std;

 

const int SZ = 1e6;

int dp[SZ];

 

int32_t main()

{

    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n;

    string s;

    cin >> n >> s;

    fill(dp, dp + SZ, 0);

    dp[0] = 0;

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

    {

        dp[i + 1] = max(dp[i + 1], dp[i]);

        if (s[i] == '1' || i == 0 || i == n - 1) continue;

        if (s[i-1] != '1' || s[i + 1] != '1') continue;

        int i1 = i - 1, i2 = i + 1;

        while (s[i1] == '1' && i1 >= 0)

            i1--;

        while (s[i2] == '1' && i2 < n)

            i2++;

        for (int j = i1 + 1; j < i; j++)

            dp[i + 2] = max(dp[i + 2], i - j + dp[j]);

        for (int j = i2 - 1; j > i; j--)

            dp[j + 1] = max(dp[j + 1], j - i + dp[i - 1]);

    }

    cout << dp[n] << endl;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <bits/stdc++.h>

using namespace std;



#define FOR(i,a,b) for(int i=(a);i<(b);++i)

#define REP(i,n)  FOR(i,0,n)



int main() {

  

  int X,Y; cin >> X >> Y;



  REP(i,1000)REP(j,1000){

    if(i+j == X){

      if(2*i + 4*j == Y){

        cout << "Yes" << endl;

        return 0;

      }

    }

  }

 cout << "No" << endl;



  return 0;

}


// Optimized solution to the same problem (faster):
#include <bits/stdc++.h>

using namespace std;



int main(){

  int X,Y; cin >> X >> Y;

  

  if(2*X<=Y && Y<=4*X && Y%2==0){

    cout << "Yes" << endl;

  }else{

    cout << "No" << endl;

  }

  

  return 0;

}


// Fastest known solution for this problem:
// Original C++ solution (slower):
#include<iostream>



int main() {

    int X, Y;

    scanf("%d%d", &X, &Y);

    puts(Y >= X * 2 && Y <= X * 4 && Y % 2 == 0 ? "Yes" : "No");

}

// Optimized solution to the same problem (faster):
#include<cstdio>



int main() {

    int X, Y;

    scanf("%d%d", &X, &Y);

    puts(Y >= X * 2 && Y <= X * 4 && Y % 2 == 0 ? "Yes" : "No");

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include<bits/stdc++.h>

using namespace std;

long long a,b;

long long fans;

int main()

{

    cin>>a>>b;

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

    {

        cout<<"Zero"<<endl;

        return 0;

    }

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

    {

        if(i<0)

         fans++;

    }

    if(fans%2==1)

      cout<<"Negative"<<endl;

    else

      cout<<"Positive"<<endl;

    return 0;

}

// Optimized solution to the same problem (faster):
#include <algorithm>

#include <cctype>

#include <cstring>

#include <cstdio>

using namespace std;

inline int read(int f = 1, int x = 0, char ch = ' ')

{

    while(!isdigit(ch = getchar())) if(ch == '-') f = -1;

    while(isdigit(ch)) x = x*10+ch-'0', ch = getchar();

    return f*x;

}

int a, b;

int main()

{

    a = read(), b = read(); if(a > b) swap(a, b);

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

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

    else if((b-a+1)&1) puts("Negative");

    else puts("Positive");

    return 0;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#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;

}

// Optimized solution to the same problem (faster):
#include <algorithm>

#include <cctype>

#include <cstring>

#include <cstdio>

using namespace std;

inline int read(int f = 1, int x = 0, char ch = ' ')

{

    while(!isdigit(ch = getchar())) if(ch == '-') f = -1;

    while(isdigit(ch)) x = x*10+ch-'0', ch = getchar();

    return f*x;

}

int a, b;

int main()

{

    a = read(), b = read(); if(a > b) swap(a, b);

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

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

    else if((b-a+1)&1) puts("Negative");

    else puts("Positive");

    return 0;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#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;

}

// Optimized solution to the same problem (faster):
#include <algorithm>

#include <cctype>

#include <cstring>

#include <cstdio>

using namespace std;

inline int read(int f = 1, int x = 0, char ch = ' ')

{

    while(!isdigit(ch = getchar())) if(ch == '-') f = -1;

    while(isdigit(ch)) x = x*10+ch-'0', ch = getchar();

    return f*x;

}

int a, b;

int main()

{

    a = read(), b = read(); if(a > b) swap(a, b);

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

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

    else if((b-a+1)&1) puts("Negative");

    else puts("Positive");

    return 0;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#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;

}

// Optimized solution to the same problem (faster):
#include <algorithm>

#include <cctype>

#include <cstring>

#include <cstdio>

using namespace std;

inline int read(int f = 1, int x = 0, char ch = ' ')

{

    while(!isdigit(ch = getchar())) if(ch == '-') f = -1;

    while(isdigit(ch)) x = x*10+ch-'0', ch = getchar();

    return f*x;

}

int a, b;

int main()

{

    a = read(), b = read(); if(a > b) swap(a, b);

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

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

    else if((b-a+1)&1) puts("Negative");

    else puts("Positive");

    return 0;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#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;

}

// Optimized solution to the same problem (faster):
#include <algorithm>

#include <cctype>

#include <cstring>

#include <cstdio>

using namespace std;

inline int read(int f = 1, int x = 0, char ch = ' ')

{

    while(!isdigit(ch = getchar())) if(ch == '-') f = -1;

    while(isdigit(ch)) x = x*10+ch-'0', ch = getchar();

    return f*x;

}

int a, b;

int main()

{

    a = read(), b = read(); if(a > b) swap(a, b);

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

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

    else if((b-a+1)&1) puts("Negative");

    else puts("Positive");

    return 0;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#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;

}

// Optimized solution to the same problem (faster):
#include <algorithm>

#include <cctype>

#include <cstring>

#include <cstdio>

using namespace std;

inline int read(int f = 1, int x = 0, char ch = ' ')

{

    while(!isdigit(ch = getchar())) if(ch == '-') f = -1;

    while(isdigit(ch)) x = x*10+ch-'0', ch = getchar();

    return f*x;

}

int a, b;

int main()

{

    a = read(), b = read(); if(a > b) swap(a, b);

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

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

    else if((b-a+1)&1) puts("Negative");

    else puts("Positive");

    return 0;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#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;

	}

}

// Optimized solution to the same problem (faster):
#include <algorithm>

#include <cctype>

#include <cstring>

#include <cstdio>

using namespace std;

inline int read(int f = 1, int x = 0, char ch = ' ')

{

    while(!isdigit(ch = getchar())) if(ch == '-') f = -1;

    while(isdigit(ch)) x = x*10+ch-'0', ch = getchar();

    return f*x;

}

int a, b;

int main()

{

    a = read(), b = read(); if(a > b) swap(a, b);

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

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

    else if((b-a+1)&1) puts("Negative");

    else puts("Positive");

    return 0;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#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;

}

// Optimized solution to the same problem (faster):
#include <algorithm>

#include <cctype>

#include <cstring>

#include <cstdio>

using namespace std;

inline int read(int f = 1, int x = 0, char ch = ' ')

{

    while(!isdigit(ch = getchar())) if(ch == '-') f = -1;

    while(isdigit(ch)) x = x*10+ch-'0', ch = getchar();

    return f*x;

}

int a, b;

int main()

{

    a = read(), b = read(); if(a > b) swap(a, b);

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

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

    else if((b-a+1)&1) puts("Negative");

    else puts("Positive");

    return 0;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#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";

 } 

// Optimized solution to the same problem (faster):
#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;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#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;

}

// Optimized solution to the same problem (faster):
#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;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#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;

}

// Optimized solution to the same problem (faster):
#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;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#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;

}

// Optimized solution to the same problem (faster):
#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;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#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;

}

// Optimized solution to the same problem (faster):
#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;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
# 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;

}

// Optimized solution to the same problem (faster):
#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");

}


// Fastest known solution for this problem:
// Original C++ solution (slower):
#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;

	}

}

// Optimized solution to the same problem (faster):
#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");

}


// Fastest known solution for this problem:
// Original C++ solution (slower):
#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");

    }

}

// Optimized solution to the same problem (faster):
#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;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#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;

}

// Optimized solution to the same problem (faster):
#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;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#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;

}

// Optimized solution to the same problem (faster):
#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;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#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;}

// Optimized solution to the same problem (faster):
#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;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
//

//  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;

}


// Optimized solution to the same problem (faster):
#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;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#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;

}

// Optimized solution to the same problem (faster):
#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;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#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;

}

// Optimized solution to the same problem (faster):
#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;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#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;

}

// Optimized solution to the same problem (faster):
#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;

}

// Fastest known solution for this problem: