Trash

#include<bits/stdc++.h>

using namespace std;

bool isImpar(int num) {
    if(num % 2 != 0) return true;
    else return false;
}


int main() {
    int grid[3][3];
    int resp[3][3];
    for(int i = 0; i < 3; i++) {
        for(int j = 0; j < 3; j++) {
            scanf("%d", &grid[i][j]);
            resp[i][j] = 0;
        }
    }
    for(int i = 0; i < 3; i++) {
        for(int j = 0; j < 3; j++) {
            if(i == 0) {
                if(j == 0) {
                    if(isImpar(grid[i][j])) {
                        resp[i][j] = 0;
                        if(isImpar(grid[i+1][j])) resp[i+1][j] = 0;
                        if(isImpar(grid[i][j+1])) resp[i][j+1] = 0;
                    }
                }
                else if(j == 1) {
                    if(isImpar(grid[i][j])) {
                        resp[i][j] = 0;
                        if(isImpar(grid[i][j]) resp[i+1][j] = 0;
                        if(isImpar(grid[i][j+1])) resp[i][j+1] = 0;
                    }
                    if(not isPar(grid[i][j])) {
                        resp[i][j]++;
                        resp[i][j-1]++;
                        resp[i][j+1]++;
                        resp[i+1][j]++;
                    }
                }
                else if(j == 2) {
                    if(not isPar(grid[i][j])) {
                        resp[i][j]++;
                        resp[i][j-1]++;
                        resp[i+1][j]++;
                    }
                }
            }
            if(i == 1) {
                if(j == 0) {
                    if(not isPar(grid[i][j])) {
                        resp[i][j]++;
                        resp[i-1][j]++;
                        resp[i+1][j]++;
                        resp[i][j+1]++;
                    }
                }
                else if(j == 1) {
                    if(not isPar(grid[i][j])) {
                        resp[i][j]++;
                        resp[i-1][j]++;
                        resp[i+1][j]++;
                        resp[i][j-1]++;
                        resp[i][j+1]++;
                    }
                }
                else if(j == 2) {
                    if(not isPar(grid[i][j])) {
                        resp[i][j]++;
                        resp[i-1][j]++;
                        resp[i+1][j]++;
                        resp[i][j-1]++;
                    }
                }
            }
            if(i == 2) {
                if(j == 0) {
                    if(not isPar(grid[i][j])) {
                        resp[i][j]++;
                        resp[i-1][j]++;
                        resp[i][j+1]++;
                    }
                }
                else if(j == 1) {
                    if(not isPar(grid[i][j])) {
                        resp[i][j]++;
                        resp[i-1][j]++;
                        resp[i][j-1]++;
                        resp[i][j+1]++;
                    }
                }
                else if(j == 2) {
                    if(not isPar(grid[i][j])) {
                        resp[i][j]++;
                        resp[i-1][j]++;
                        resp[i][j-1]++;
                    }
                }
            }
        }
    }

    for(int i = 0; i < 3; i++) {
        for(int j = 0; j < 3; j++) {
            cout << resp[i][j];
        }
        cout << endl;
    }

    return 0;
}