//set many funcs template
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<stdbool.h>
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007
#define pi 3.1415926535897932384

int max(int a,int b){if(a>b){return a;}return b;}
int min(int a,int b){if(a<b){return a;}return b;}
int zt(int a,int b){return max(a,b)-min(a,b);}
int round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
int ceil(int a,int b){if(a%b==0){return a/b;}return (a/b)+1;}
int gcd(int a,int b){int c;while(b!=0){c=a%b;a=b;b=c;}return a;}
int lcm(int a,int b){int c=gcd(a,b);a/=c;return a*b;}
int nCr(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}
int fact(int a){int i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}
int pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}
long long llmax(long long a,long long b){if(a>b){return a;}return b;}
long long llmin(long long a,long long b){if(a<b){return a;}return b;}
long long llzt(long long a,long long b){return llmax(a,b)-llmin(a,b);}
long long llround(long long a,long long b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
long long llceil(long long a,long long b){if(a%b==0){return a/b;}return (a/b)+1;}
long long llgcd(long long a,long long b){long long c;while(b!=0){c=a%b;a=b;b=c;}return a;}
long long lllcm(long long a,long long b){long long c=llgcd(a,b);a/=c;return a*b;}
long long llnCr(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}
long long llfact(long long a){long long i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}
long long llpow(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}
double dbmax(double a,double b){if(a>b){return a;}return b;}
double dbmin(double a,double b){if(a<b){return a;}return b;}
double dbzt(double a,double b){return dbmax(a,b)-dbmin(a,b);}
int sortfncsj(const void *a,const void *b){if(*(int *)a>*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}
int sortfnckj(const void *a,const void *b){if(*(int *)a<*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}
int llsortfncsj(const void *a,const void *b){if(*(long long *)a>*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}
int llsortfnckj(const void *a,const void *b){if(*(long long *)a<*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}
int dbsortfncsj(const void *a,const void *b){if(*(double *)a>*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}
int dbsortfnckj(const void *a,const void *b){if(*(double *)a<*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}
int strsortfncsj(const void *a,const void *b){return strcmp((char *)a,(char *)b);}
int strsortfnckj(const void *a,const void *b){return strcmp((char *)b,(char *)a);}

long long power(long long a, long long b){
	long long x = 1, y = a;
	while (b > 0){
		if(b%2){
			x = (x*y)%mod;
		}
		y = (y*y)%mod;
		b /= 2;
	}
	return x%mod;
}

long long s,sy[1024],sc=0,ar[25252525];

void calcy(){
    long long i;
    for(i=0;i<1024;i++){sy[i]=llinf;}
    for(i=1;i*i<=s;i++){
        if(s%i!=0){continue;}
        sy[sc]=i;sc++;
        if(i*i!=s){sy[sc]=s/i;sc++;}
    }
    qsort(sy,sc,sizeof(long long),llsortfncsj);
}

void makear(){
    long long i,j,st,fi;
    ar[0]=0;
    for(i=1;i<=8;i++){
        st=llpow(10,i-1);
        fi=llpow(10,i)-1;
        for(j=st;j<=fi;j++){
            ar[j]=i;
            if(j==25252524){break;}
        }
    }
}

long long mima(long long x,long long y){
    if(x%y){return x/y;}return (x/y)-1;
}

int main(void){
    long long i,j,r=0,lef,rig,asum,ks,v=0;
    scanf("%lld",&s);
    calcy();
    for(i=0;i<sc;i++){
        r+=mod;r+=mod;r+=mod;
        if(sy[i]>=12 || llpow(10,sy[i])-llpow(10,sy[i]-1)-(s/sy[i])+1>=0){
        r+=power(10,sy[i]);
        r-=power(10,sy[i]-1);
        r-=(s/sy[i]);
        r++;
        }
        r%=mod;
    }
    makear();
    lef=1;rig=1;asum=0;
    while(ar[lef]!=8){
        if(asum>s){asum-=ar[lef];lef++;}
        else{asum+=ar[rig];rig++;}
        if(asum==s && ar[lef]!=ar[rig-1]){r++;r%=mod;}
    }
    //printf("<%lld>\n",r);
    ks=mima(s,8);
    for(i=0;i<sc;i++){
        if(sy[i]<=ks){v++;}else{break;}
    }
    r+=ks;r-=v;r%=mod;
    printf("%lld\n",r);
    return 0;
}

Measured memory_bytes: 197632