#include<string> #include<deque> #include<queue> #include<vector> #include<algorithm> #include<iostream> #include<set> #include<cmath> #include<tuple> #include<chrono> #include<functional> #include<random> #include<unordered_set> using namespace std; typedef long long int llint; #define mp make_pair #define mt make_tuple #define pub push_back #define puf push_front #define pob pop_back #define pof pop_front #define fir first #define sec second #define res resize #define ins insert #define era erase const llint mod=1000000007; const llint big=1e17-10; const long double pai=3.141592653589793238462643383279; template <class T,class U>void mineq(T& a,U b){if(a>b){a=b;}} template <class T,class U>void maxeq(T& a,U b){if(a<b){a=b;}} int main(void){ llint a,b=0,i,gen=1; cin>>a; for(int i=0;i<9;i++){ if(((a%(gen*10))/gen)==7){b+=gen;a-=gen;}gen*=10; } cout<<a<<" "<<b<<endl; return 0; }