import java.io.*; import java.math.*; import java.text.*; import java.util.*; import java.util.regex.*; public class Solution { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int t = sc.nextInt(); for (int i = 0; i = size) { return true; } else { visited[curr] = true; if (validJump(arr, visited, curr + jump, size)) { return solve(arr, visited, curr + jump, jump, size); } if (validJump(arr, visited, curr + 1, size)) { return solve(arr, visited, curr + 1, jump, size); } if (validJump(arr, visited, curr - 1, size)) { return solve(arr, visited, curr - 1, jump, size); } } return false; } public static boolean validJump(int[] arr, boolean[] visited, int index, int size) { if (index