#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<algorithm>

 #define m 1000000007

 using namespace std;

 typedef long long ll;

 const int MAXN=+;

 ll n;

 char str[MAXN];

 void init()

 {

     n=;

     int len=strlen(str);

     for (int i=;i<len;i++)

         n=(n*+str[i]-'')%(m-);

     n--;

 }

 ll pow()

 {

     ll temp=n,k=,ret=;

     while (temp)

     {

         if (temp&) ret=ret*k%m;

         temp>>=;

         k=(k*k)%m;

     }

     return ret;

 }

 int main()

 {

     while (~scanf("%s",str))

     {

         init();

         cout<<pow()<<endl;

     }

     return ;

 }