import * as fs from 'fs'

// import * as readline from 'readline'
// const rl = readline.createInterface({ input: process.stdin, output: process.stdout })
// const ask = (query: string) => new Promise<string>((resolve) => rl.question(query, resolve))
// // Don't forget `rl.close()`.

const INT = Math.floor

declare global {
  interface Array<T> {
    last(): T | undefined
    isEmpty(): boolean
  }
}
Array.prototype.last = function () {
  return this.length === 0 ? undefined : this[this.length - 1]
}
Array.prototype.isEmpty = function () {
  return this.length === 0
}

const bigIntMax = (...args: bigint[]) => args.reduce((m, e) => (e > m ? e : m))
const bigIntMin = (...args: bigint[]) => args.reduce((m, e) => (e < m ? e : m))
const bigIntAbs = (arg: bigint) => (arg < 0 ? -arg : arg)

declare const stdin: number
function read_stdin() {
  return fs.readFileSync(process.env.NODE_ENV === 'debug' ? stdin : process.stdin.fd, 'utf8')
}
class Input {
  readonly inputs: string[]
  private index = 0
  constructor(str?: string) {
    this.inputs = (str ? str : read_stdin()).split(/\s+/)
  }
  number() {
    return Number(this.inputs[this.index++])
  }
  numbers(n: number) {
    return this.inputs.slice(this.index, (this.index += n)).map(Number)
  }
  bigint() {
    return BigInt(this.inputs[this.index++])
  }
  bigints(n: number) {
    return this.inputs.slice(this.index, (this.index += n)).map(BigInt)
  }
  word() {
    return this.inputs[this.index++]
  }
  words(n: number) {
    return this.inputs.slice(this.index, (this.index += n))
  }
}

function array<T>(len: number, init: T): T[] {
  return Array(len).fill(init)
}

function array2<T>(h: number, w: number, init: T): T[][] {
  return array(h, 0).map(() => array(w, init))
}

function main() {
  const input = new Input()

  const P = input.number()

  const HAVENT3 = 0
  const HAS3 = 1
  let dp = array2(3, 2, 0n)
  dp[0][HAVENT3] = 1n

  for (let i = 0; i < P; i++) {
    const dp2 = array2(3, 2, 0n)
    for (let mod3 = 0; mod3 < 3; mod3++) {
      for (let n3 = 0; n3 < 2; n3++) {
        for (let j = 0; j < 10; j++) {
          let curr_mod3 = (mod3 + j) % 3
          let curr_n3 = j === 3 ? HAS3 : n3
          dp2[curr_mod3][curr_n3] += dp[mod3][n3]
        }
      }
    }
    dp = dp2
  }

  const ans = dp[0][HAVENT3] + dp[0][HAS3] + dp[1][HAS3] + dp[2][HAS3]
  console.log((ans - 1n).toString())
}

main()