Q7_1617.cpp

/*
 * Name: Om Singh
 * Reg No: 2341019519
 * PS LINK: https://cses.fi/problemset/task/1617
 */

#include<iostream>
using namespace std;
using ll = long long;

ll pow(int p,ll n ,ll mod){
   ll ans = 1;
   for(ll i=0;i<n;i++){
    ans=ans*p%mod;
   } 
   return ans;
}

int main(){
ll n;
cin>>n;
cout<<pow(2,n,1e9+7);
    return 0;
}