#include<bits/stdc++.h>
using namespace std;
 
#define debug(x) cerr << #x << ": " << (x) << endl
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define dwn(i,a,b) for(int i=(a);i>=(b);i--)
#define pb push_back
#define all(x) (x).begin(), (x).end()
 
#define x first
#define y second
using pii = pair<int, int>;
using ll = long long;

#define int ll

int n;
string s;
int len;
bool b[10];

signed main(){
	cin>>n;
	s=to_string(n);
	len=s.size();
	if(len==1){
		cout<<n-1<<" "<<n+1;
		return 0;
	}
	
	for(auto e: s) b[e-'0']=true;
	bool fl=true;
	rep(i, 0, 9) if(!b[i]) fl=false;
	if(fl){
		puts("Impossible");
		return 0;
	}
	vector<int> a;
	rep(i, 0, 9) if(!b[i]) a.pb(i);
	
	int x=-1, y=-1;
	
	int fir=s[0]-'0';
	rep(i, 0, fir-1){
		int val;
		if(i && b[i]) continue;
		int rec;
		dwn(i, 9, 0) if(!b[i]){
			rec=i;
			break;
		}
		if(!i){
			if(!rec){
				val=0;
			}
			else{
				val=stoll(string(len-1, rec+'0'));
			}
		}
		else{
			string tmp;
			tmp.pb(char(i+'0'));
			tmp+=string(len-1, rec+'0');
			val=stoll(tmp);
		}
		x=val;
	}
	
	int mn=0; // only zero?
	rep(i, 1, 9) if(!b[i]){
		mn=i;
		break;
	}
	if(mn){
		rep(i, fir+1, 9){
			if(i && b[i]) continue;
			
			string tmp;
			tmp.pb(char(i+'0'));
			if(!b[0]) tmp+=string(len-1, '0');
			else tmp+=string(len-1, '0'+mn);
			y=stoll(tmp);
			
			break;
		}	
		if(y==-1){
			// len+1
			string tmp;
			tmp.pb(char(mn+'0'));
			if(!b[0]) tmp+=string(len, '0');
			else tmp+=string(len, mn+'0');
			y=stoll(tmp);
		}
	}
	
	if(x==-1) cout<<y;
	else if(y==-1) cout<<x;
	else{
		if(n-x==y-n) cout<<x<<" "<<y;
		else if(n-x>y-n) cout<<y;
		else cout<<x;
	}
	
	return 0;
}