import java.math.BigInteger;
import java.util.Arrays;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Scanner;
import java.util.Set;
import java.util.function.LongPredicate;
import java.util.stream.IntStream;
import java.util.stream.LongStream;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		final int P = sc.nextInt();
		
		final int MOD = 3;
		final BigInteger big_MOD = BigInteger.valueOf(MOD);
		
		long[] pow10 = new long[P + 1];
		for(int i = 0; i <= P; i++){
			pow10[i] = (i == 0 ? 1 : pow10[i - 1] * 10);
		}
			
		BigInteger[][] DP = new BigInteger[P + 1][MOD];
		for(int i = 0; i <= P; i++){
			for(int j = 0; j < MOD; j++){
				DP[i][j] = BigInteger.ZERO;
			}
		}
		
		for(int digit = 1; digit <= P; digit++){
			for(int first = 0; first <= 9; first++){
				if(first == 3){
					for(int i = 0; i < MOD; i++){
						DP[digit][i] = DP[digit][i].add(BigInteger.TEN.pow(digit - 1).divide(big_MOD).add(i == 0 ? BigInteger.ONE : BigInteger.ZERO));
						//DP[digit][i] += (pow10[digit - 1] / MOD) + (i == 0 ? 1 : 0);
					}
				}else{
					for(int i = 0; i < MOD; i++){
						DP[digit][(first + i) % MOD] = DP[digit][(first + i) % MOD].add(DP[digit - 1][i]);
						//DP[digit][(first + i) % MOD] += DP[digit - 1][i];
					}
				}
			}
		}
		System.out.println(DP[P][1].add(DP[P][2]).add(BigInteger.TEN.pow(P).divide(big_MOD)));
		/*
		System.out.println(LongStream.range(1, pow10[P]).filter(new LongPredicate() {
			public boolean test(long value) {
				return value % 3 == 0 || Long.toString(value).contains("3");
			}
		}).count());
		/*
		System.out.println(Arrays.deepToString(DP));
		*/
	}

}