答案 是 2^(N-1);
(2^500000003)%mod = 1; 所以。。。。。。大整数取完模之后快速幂即可
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
using namespace std;
#define clr(a, x) memset(a, x, sizeof(a))
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i,a,b) for(int i=a;i<=b;i++)
typedef __int64 lld;
const int maxn = 100010;
const int mod = 1000000007;
const int M = 500000003;
char s[maxn];
int main()
{
while(~scanf("%s",s))
{
int len=strlen(s);
for(int i=len-1;i>=0;i--)
{
if(s[i]>'0')
{
s[i]--;
break;
}
else s[i]='9';
}
lld n=0,ans=1,t=2;
for(int i=0;i<len;i++)
n=(n*10+s[i]-'0')%M;
while(n)
{
if(n&1) ans=ans*t%mod;
n>>=1;
t=t*t%mod;
}
printf("%I64d\n",ans);
}
}