#include<vector>
#include<iostream>
#include<algorithm>
#include<tuple>
using namespace std;

class Div
{
public:
    int a1,a2;
    tuple<int,int> calc(int n){
        for(int i=1;i<=10;i++){
        a1=i;
        a2=n-a1;
        if((a1<=10)&&(a2<=10)){
            return forward_as_tuple(a1,a2);
            break;

        }
        else{
            continue;
        
        }
        return forward_as_tuple(-1,-1);
    }
    }
    

};
void solve(){
    Div div;
    int n,ans1,ans2;
    cin>>n;
    tie(ans1,ans2)=div.calc(n);

    cout<<ans1<<" "<<ans2<<endl;
}

int main(){
    solve();
    return 0;
}