#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

const int ROWS = 100;
const int COLS = 100;


const int dir = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};


bool isValid(int x, int y) {
    return x >= 0 && x < ROWS && y >= 0 && y < COLS;
}


void dfs(vector<vector<int>>& grid, int x, int y) {

    grid[x][y] = -1;

    for (int i = 0; i < 4; ++i) {
        int nx = x + dir[i];
        int ny = y + dir[i];


        if (isValid(nx, ny) && grid[nx][ny] != -1) {
            dfs(grid, nx, ny);
        }
    }
}

int main() {

    vector<vector<int>> grid(ROWS, vector<int>(COLS, 0));

 

 
    int startX = 0;  
    int startY = 0;  
    dfs(grid, startX, startY);



    return 0;
}

rt.