#include <iostream>
using namespace std;
int main(){
	char c[21];
	int n = 0;
	while(cin >> c[n]){n++;}
	for(int i=n-1;i>=0;i--) cout << c[i];
	cout << endl;
}
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln =  '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define rept(i, j, n) for(int i=(j); i<(n); i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }


int main(){ 
  int a, b; cin >> a >> b;
  int num = 1, cnt = 0;
  while(num < b){
      num += a - 1;
      cnt++;
  }
  cout << cnt << ln;
}

