CF185A.Plant

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Dwarfs have planted a very interesting plant, which is a triangle directed "upwards". This plant has an amusing feature. After one year a triangle plant directed "upwards" divides into four triangle plants: three of them will point "upwards" and one will point "downwards". After another year, each triangle plant divides into four triangle plants: three of them will be directed in the same direction as the parent plant, and one of them will be directed in the opposite direction. Then each year the process repeats. The figure below illustrates this process.

Help the dwarfs find out how many triangle plants that point "upwards" will be in nn years.

输入格式

The first line contains a single integer nn (0<=n<=1018)(0<=n<=10^{18}) — the number of full years when the plant grew.

Please do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use cin, cout streams or the %I64d specifier.

输出格式

Print a single integer — the remainder of dividing the number of plants that will point "upwards" in nn years by 10000000071000000007 (109+7)(10^{9}+7) .

输入输出样例

  • 输入#1

    1
    

    输出#1

    3
    
  • 输入#2

    2
    

    输出#2

    10
    

说明/提示

The first test sample corresponds to the second triangle on the figure in the statement. The second test sample corresponds to the third one.

首页