package ZK.Coding;
import java.util.Scanner;
public class yanhuitriangle {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
while(scanner.hasNext()){
int n = scanner.nextInt();
int [][] map = new int [n+1][2*n];
map[1][1]=1; //下标从1开始
for(int i=2;i<=n;i++){
map[i][1]=1;
for(int j =2;j<=2*i-1;j++){//默认赋0 j=2
map[i][j]=map[i-1][j]+map[i-1][j-1]+map[i-1][j-2];
}
}
//System.out.println(map[0][0]);
//遍历 只需遍历到中间位置即可
int k=1;
boolean flag = false;
for( k =1;k<=n;k++){
if(map[n][k]%2==0){
flag=true;
System.out.println(k);
break;//找到就跳出
}
}
if(!flag || n<=2){
System.out.println("-1");
}
}
}
}
import java.util.Scanner;
public class yanhuitriangle {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
while(scanner.hasNext()){
int n = scanner.nextInt();
int [][] map = new int [n+1][2*n];
map[1][1]=1; //下标从1开始
for(int i=2;i<=n;i++){
map[i][1]=1;
for(int j =2;j<=2*i-1;j++){//默认赋0 j=2
map[i][j]=map[i-1][j]+map[i-1][j-1]+map[i-1][j-2];
}
}
//System.out.println(map[0][0]);
//遍历 只需遍历到中间位置即可
int k=1;
boolean flag = false;
for( k =1;k<=n;k++){
if(map[n][k]%2==0){
flag=true;
System.out.println(k);
break;//找到就跳出
}
}
if(!flag || n<=2){
System.out.println("-1");
}
}
}
}