jogop1f2.cpp

#include<bits/stdc++.h>

using namespace std;

int mat[128][128];

int main(){
 int n;
 cin >> n;
 for(int i = 1; i <= n; ++i)
   for(int j = 1; j <= n; ++j)
     cin >> mat[i][j];
 for(int i = 2; i <= n; ++i)
   for(int j = 2; j <= n; ++j){
     if(mat[i - 1][j] + mat[i][j - 1] + mat[i - 1][j - 1] > 1)  mat[i][j] = 0;
     else mat[i][j] = 1;
   }  
 cout << mat[n][n] << "\n"; 
 return 0; 
}