DFS on grid

#include <stdio.h>

int dr[] = {-1,  0,  0, +1};
int dc[] = { 0, -1, +1,  0};

int a[7][7];
int vis[7][7];
int ar, ac;
int n;

void dfs(int r, int c){
    vis[r][c] = 1;
    for(int i=0; i<4; i++){
        int vr = r + dr[i];
        int vc = c + dc[i];
        if(vr < 0 || vr == n || vc < 0 || vc == n || a[vr][vc] != 1) continue;

        if(!vis[vr][vc]){
             ar = vr;
             ac = vc;
             dfs(vr, vc);
        }
    }
}
int main()
{
    n = 6;
    for(int i=0; i<6;i++){
        for(int j=0; j<6; j++){
            scanf("%d", &a[i][j]);
        }
    }
    int sr, sc;
    scanf("%d %d", &sr, &sc);
    dfs(sr, sc);
    printf("Final row: %d \n Final colum: %d \n", ar, ac);
}