#include<bits/stdc++.h>
using namespace std;
#define print(a) for(auto x:a)cout<<x<<" "
#define debug(x) cout<<#x<<" "<<x<<endl
#define all(a) (a).begin(),(a).end()
#define sz(a) (int)(a.size())
#define int long long int
#define endl '\n'
#define ar array
const int M = 1e9 + 7;
const int N = 2e3+10;
void solve(){
string s;cin>>s;
set<char>st;
vector<int>cnt(26,0);
for(auto c:s)st.insert(c),cnt[c-'a']++;
int n=sz(s);
bool ok=sz(st)==1;
for(int i=0;i<26;i++){
ok|=(cnt[i]==(n-1));
}
if(ok){
cout<<"Impossible\n";return;
}
if(n&1){
cout<<2<<endl;return;
}
for(int i=0;i+1<n;i++){
string t=s.substr(i+1,n-i-1)+s.substr(0,i+1);
string tt=t;
reverse(all(t));
if(t==tt && s!=t){
cout<<1<<endl;return;
}
}
cout<<2<<endl;
}
signed main(){
ios_base::sync_with_stdio(0);cin.tie(0);
int t=1; //cin>>t;
while(t--)solve();
return 0;}
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |