#include using namespace std; #define ll long long int #define el "\n" #define fio ios_base::sync_with_stdio(false),cin.tie(NULL) #define ull unsigned long long int #define ld long double #define F first #define S second #define PB push_back #define MP make_pair #define LB lower_bound//pass (a,a+n,key) #define UB upper_bound #define vi vector #define pi pair //rotate array d times using--> rotate(a,a+d,a+n); //reverse array of d elements using--> reverse(a,a+d); const long double PI = atan(1.0)*4.0; const ll M = 1000000007; const ll INF = 1e18; const ll E=1e-9; bool isprime(ll n) { for(ll i=2;i*i<=n;i++) { if(n%i==0) return false; } return true; } bool iseql(ld n,ld m) { if(abs(n-m)>n; int p[n]={0}; int a,b,c,d,i; cin>>a>>b>>c>>d; if(abs(b-d)%2==0 && abs(b-d)!=0) cout<<"Impossible"; else if( b==d && abs(a-c)%2==1) cout<<"Impossible"; else if(b==d && a>c) { cout<<(a-c)/2<c && b==d) { a=a-2; b--; cout<<"UL"<<" "; } if(bd) { b--; a=a+2; cout<<"LL"<<" "; } // cout<c && dc && d>b) { b++; a=a-2; p[i]=2; i++; } else if(a==c && b>d) { b=b-2; p[i]=6; i++; } else if(a==c && b