void dfs(int v, int[] was1, int[] was2) {
		++counter$0;
		long counterBefore = tempCounter1;
		if (true) {
			if (was2[v] == 2 || was1[v] == 1) {
				memCounter$1 = Math.max(tempCounter1, counterBefore);
				{
					tempCounter1 = counterBefore;
					return;
				}
			}
			was1[v] = 1;
			tempCounter1 = tempCounter1 + 4;
			for (int i = 0; i < n; i++) {
				++counter$1;
				if (a[v][i] == 1) {
					dfs(i, was1, was2);
				}
			}
		}
		memCounter$1 = Math.max(tempCounter1, counterBefore);
	}