description: You are given two positive integers n and s. Find the maximum possible median of an array of n non-negative integers (not necessarily distinct), such that the sum of its elements is equal to s.
  
  A median of an array of integers of length m is the number standing on the ⌈ {m/2} ⌉-th (rounding up) position in the non-decreasing ordering of its elements. Positions are numbered starting from 1. For example, a median of the array [20,40,20,50,50,30] is the ⌈ m/2 ⌉-th element of [20,20,30,40,50,50], so it is 30. There exist other definitions of the median, but in this problem we use the described definition.
  
  Input
  
  The input consists of multiple test cases. The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases. Description of the test cases follows.
  
  Each test case contains a single line with two integers n and s (1 ≤ n, s ≤ 10^9) — the length of the array and the required sum of the elements.
  
  Output
  
  For each test case print a single integer — the maximum possible median.
  
  Example
  
  Input
  
  
  8
  1 5
  2 5
  3 5
  2 1
  7 17
  4 14
  1 1000000000
  1000000000 1
  
  
  Output
  
  
  5
  2
  2
  0
  4
  4
  1000000000
  0
  
  Note
  
  Possible arrays for the first three test cases (in each array the median is underlined):
  
    * In the first test case [\underline{5}] 
    * In the second test case [\underline{2}, 3] 
    * In the third test case [1, \underline{2}, 2] 
solution: import java.util.*;
  import java.io.*;
  import java.io.BufferedReader;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.util.Scanner;
  import java.util.StringTokenizer;
  
  public class Test{
  
          static FastReader scan;
  
          static void solve(){
              int n=scan.nextInt();
              int s=scan.nextInt();
              int k=n;
              
                  n=n/2;
                  n++;
              System.out.println(s/n);
  
          }
  
          public static void main (String[] args) throws java.lang.Exception{
              scan=new FastReader();
              int t=scan.nextInt();
              while(t-->0){
                  solve();
              }
          }
  
          static class FastReader {
              BufferedReader br;
              StringTokenizer st;
  
              public FastReader()
              {
                  br = new BufferedReader(
                      new InputStreamReader(System.in));
              }
  
              String next()
              {
                  while (st == null || !st.hasMoreElements()) {
                      try {
                          st = new StringTokenizer(br.readLine());
                      }
                      catch (IOException e) {
                          e.printStackTrace();
                      }
                  }
                  return st.nextToken();
              }
  
              int nextInt() { return Integer.parseInt(next()); }
  
              long nextLong() { return Long.parseLong(next()); }
  
              double nextDouble() { return Double.parseDouble(next()); }
  
              String nextLine()
              {
                  String str = "";
                  try {
                      str = br.readLine();
                  }
                  catch (IOException e) {
                      e.printStackTrace();
                  }
                  return str;
              }
          }
  
          static class Pair implements Comparable<Pair>{
              long wt;
              long idx;
              Pair(long x,long y){
                  this.wt=x;
                  this.idx=y;
              }
              @Override
              public int compareTo(Pair x){
                  return (int)(this.wt-x.wt);
              }
  
              public String toString(){
                  return "( "+wt+" "+idx+" )";
              }
          }        
  
          static void printLong(long []arr){
              for(long x:arr)System.out.print(x+" ");
          }
  
          static void printInt(int []arr){
              for(int x:arr)System.out.print(x+" ");
          }
  
          static void scanInt(int []arr){
              for(int i=0;i<arr.length;i++){
                  arr[i]=scan.nextInt();
              }
          }
  
          static void scanLong(long []arr){
              for(int i=0;i<arr.length;i++){
                  arr[i]=scan.nextLong();
              }
          }
  
          static long gcd(long a, long b){
              if (b == 0)
                  return a;
              
              return gcd(b, a % b);
          }   
  
          static long power(long x, long y, long mod){
              long res = 1; 
          
              x = x % mod; 
           
              if (x == 0)
                return 0; 
           
              while (y > 0){              
                  if ((y & 1) != 0)
                  res = (res * x) % mod;
                
                  y = y >> 1; 
                  x = (x * x) % mod;
              }
                  return res;
          }
  
          static long add(long a,long b,long mod){
              a = a % mod; 
              b = b % mod; 
              return (((a + b) % mod) + mod) % mod;
          }
  
          static long sub(long a, long b,long mod){
              a = a % mod; 
              b = b % mod; 
              return (((a - b) % mod) + mod) % mod;
          }
  
          static long mul(long a, long b,long mod){
              a = a % mod; 
              b = b % mod; 
              return (((a * b) % mod) + mod) % mod;
          }
          
  
          static long mminvprime(long a, long b,long mod) {
              return power(a, b - 2,mod);
          }
  }
  