#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
 
using ll = unsigned long long int;
 
ll mod0 = 1000000000LL;
ll mod7 = 1000000007LL;
 
int main(void){
    
    string s;
    cin >> s;
    
    ll ans0 = 0,ans7 = 0,tmp0 = 9,tmp7 = 9;
    
    for(int i = 0; i < s.size()-1; i ++){
        if(!(i%2) && i >= 2) tmp0 *= 10;
        if(!(i%2) && i >= 2) tmp7 *= 10;
        
        tmp0 %= mod0;
        tmp7 %= mod7;
        
        ans0 += tmp0;
        ans7 += tmp7;
        
        ans0 %= mod0;
        ans7 %= mod7;
        
        //cout << ans0 << endl;
    }
    
    for(int i = 0; i < (s.size()+1)/2; i++){
        int a = min(s[i]-'0',s[s.size()-(i+1)]-'0');
        
        if(i == 0){
            tmp0 = a;
            tmp7 = a;
        }else{
            
            a += 1;
            
            tmp0 *= a;
            tmp7 *= a;
            
        }
        
        tmp0 %= mod0;
        tmp7 %= mod7;
    }
    
    ans0 += tmp0;
    ans7 += tmp7;
    
    ans0 %= mod0;
    ans7 %= mod7;
    
    cout << ans0 << endl;
    cout << ans7 << endl;
    
    
    
}