//mod为素数时,a的逆元就是a^(mod-2),当mod为素数时,就直接用快速幂求出a^(mod-2)即是a的逆元import java.util.*;publicclassMain{publicstaticlong mod =(int)1e9+7;publicstaticlongqPow(long a,long b,long mod){long ans =1;while(b!=0){if(((b&1)==1)){
ans = ans*a%mod;}
a = a*a%mod;
b >>=1;}return ans%mod;}publicstaticlonginv(long a){returnqPow(a,mod-2,mod);}publicstaticvoidmain(String[] args){
Scanner scanner =newScanner(System.in);long a = scanner.nextLong();
System.out.println(inv(a));}}