import java.util.Scanner;
// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
// 注意 hasNext 和 hasNextLine 的区别
int n = in.nextInt();
//这个题目和斐波那契数列类似,用最简单的递归来解决(不考虑性能) 法1:递归 法2:交换 法3:数组 法4:dp 法5:矩阵
System.out.println(getAnRecursion(n));
}
static int getAnRecursion(int n){
if(n==1){
return 0;
}
if(n==2 || n==3){
return 1;
}
return getAnRecursion(n-3)+2*getAnRecursion(n-2)+getAnRecursion(n-1);
}
} import java.util.*;
public class Main{
public static int[] flag = new int[25];
public static void main(String[] args){
Scanner in = new Scanner(System.in);
int n = in.nextInt();
System.out.println(Main.dfs(n));
}
public static int dfs(int n){
if(flag[n]!=0)return flag[n];//备忘录
if(n==1){
Main.flag[1] = 0;
return 0;
}
else if(n==2||n==3){
Main.flag[2] = 1;
Main.flag[3] = 1;
return 1;
}
int res = dfs(n-3)+2*dfs(n-2)+dfs(n-1);
flag[n] = res;
return res;
}
} import java.util.Scanner;
// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
System.out.println(A(n));
}
public static int A(int m){
if(m==1){
return 0;
}
else if(m==2||m==3){
return 1;
}
else{
return A(m-3)+2*A(m-2)+A(m-1);}
}
} import java.util.Scanner;
// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int a = in.nextInt();
int b = 0;
int a1= 0;
int a2= 1;
int a3= 1;
if (a==2|a==3){
b=1;
}
for (int i=4;i<=a;i++){
if (a>=4){
b = a1+2*a2+a3;
a1=a2;
a2=a3;
a3=b;
}
}
System.out.println(b);
}
}