#include using namespace std; struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);cout.precision(20);}} fast; /* define */ #define FOR(I,X,Y) for(long long (I)=(X);(I)<(Y);(I)++) #define REP(I,X,Y) for(long long (I)=(Y)-1;(I)>=(X);(I)--) #define ALL(X) (X).begin(),(X).end() #define pb push_back #define COUNT(V,X) (upper_bound((V).begin(),(V).end(),X)-lower_bound((V).begin(),(V).end(),X)) #define debug(x) cerr<<#x<<':'<; using vii = vector>; using vl = vector; using vll = vector>; using pi = pair; using pl = pair; template using PQ = priority_queue; template using minPQ = priority_queue, greater>; /* const */ const long long dx[] = {1,0,-1,0}; const long long dy[] = {0,1,0,-1}; const long long dx8[] = {1,1,0,-1,-1,-1,0,1}; const long long dy8[] = {0,1,1,1,0,-1,-1,-1}; const long long dx9[] = {1,1,0,-1,-1,-1,0,1,0}; const long long dy9[] = {0,1,1,1,0,-1,-1,-1,0}; const int INF = 1000000007; const long long LINF = 1000000000000000007; /* func */ template inline bool chmin(T& a, const T& b) {if (a > b) a = b; return a > b;} template inline bool chmax(T& a, const T& b) {if (a < b) a = b; return a < b;} long long max(long long x,int y){return max(x,(long long)y);} long long max(int x,long long y){return max((long long)x,y);} long long min(long long x,int y){return min(x,(long long)y);} long long min(int x,long long y){return min((long long)x,y);} /* liblary */ /* main */ signed main(){ ll C; cin >> C; cout << 1 << ' ' << C << endl; }