#include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;
 
template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}

// a^n (mod m)
ll pow_mod(ll a,ll n,ll m){
    ll ret=1;
    while(n){
        if(n&1) ret=ret*a%m;
        a=(a*a)%m;
        n/=2;
    }
    return ret;
}


ll inv_mod(ll a,ll m){
    ll b=m,u=1,v=0,t;
    while(b){
        t=a/b;
        swap(a-=t*b,b);swap(u-=t*v,v);
    }
    u%=m;
    if(u<0) u+=m;
    return u;
}


ll solve(string s,ll mod){
    int n=(int)s.size();
    int m=n/2;
    // 0:up, 1:eq, 2:lw
    auto left=[&](int flag,int put,int dig){
        if(flag==0){
            return flag;
        }
        if(flag==1){
            if(put==dig) return 1;
            else if(put<dig) return 2;
            return 0;
        }
        if(flag==2){
            return 2;
        }
        return -1;
    };
    auto right=[&](int flag,int put,int dig){
        if(dig==put){
            return flag;
        }
        if(put<dig) return 2;
        return 0;
    };

    vector<vector<vector<ll>>> dp(m+1,vector<vector<ll>>(3,vector<ll>(3,0)));
    dp[0][1][1]=1;

    for(int i=0;i<m;i++){
        int u=s[i]-'0',d=s[n-1-i]-'0';
        for(int p=0;p<10;p++){
            if(i==0 and p==0) continue;

            rep(j,3){
                rep(k,3){
                    int lt=left(j,p,u);
                    int rt=right(k,p,d);

                    dp[i+1][lt][rt]=(dp[i+1][lt][rt]+dp[i][j][k])%mod;
                }
            }
        }
    }

    // rep(j,3)rep(k,3){
    //     cout<<j<<", "<<k<<" : "<<dp[m][j][k]<<endl;
    // }

    ll ret=0;
    if(n&1){
        int mid=s[n/2]-'0';
        rep(i,10){
            if(i<mid){
                // ret+=   dp[m][0][0]+dp[m][0][0]+dp[m][0][0]+
                //         dp[m][1][0]+dp[m][1][1]+dp[m][1][2]+
                //         dp[m][2][0]+dp[m][2][1]+dp[m][2][2];

                ret+=   
                        dp[m][1][0]+dp[m][1][1]+dp[m][1][2]+
                        dp[m][2][0]+dp[m][2][1]+dp[m][2][2];
                     
                ret%=mod;
            }else if(i==mid){
                ret+=   
                                    dp[m][1][1]+dp[m][1][2]+
                        dp[m][2][0]+dp[m][2][1]+dp[m][2][2];
                ret%=mod;
            }else{
                ret+=   
                        
                        dp[m][2][0]+dp[m][2][1]+dp[m][2][2];
                ret%=mod;
            }
        }
    }else{
        ret+=   
                dp[m][1][1]+dp[m][1][2]+
                dp[m][2][0]+dp[m][2][1]+dp[m][2][2];
        ret%=mod;
    }
    return ret;
}

void unk(string s,ll mod){
    int n=(int)s.size();

    if(n==1){
        cout<<(s[0]-'0')<<endl;
        return ;
    }

    ll res=0;
    for(int i=1;i<n;i++){
        int fr=i/2+i%2-1;
        ll add=pow_mod(10,fr,mod)*9%mod;
        res=(res+add)%mod;
    }
    res+=solve(s,mod);
    res%=mod;
    cout<<res<<endl;
}

signed main(){
    string s;cin>>s;
    unk(s,1000000000);
    unk(s,1000000007);
    return 0;
}