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.io.*;
  import java.util.*;
  import java.math.*;
  public class Solution {
      InputStream is;
      PrintWriter o;
      /////////////////// CODED++ BY++ ++ ++ ++ BHAVYA++ ARORA++ ++ ++ ++ FROM++ JAYPEE++ INSTITUTE++ OF++ INFORMATION++ TECHNOLOGY++ ////////////////
  ///////////////////////// Make it work, make it right, make it fast. Make it work, make it right, make it fast. Make it work, make it right, make it fast. Make it work, make it right, make it fast. /////////////////
   void solve() {
       int t=ni();
       while(t-->0){
           int n=ni();
           int s=ni();
  
           int div=n/2+1;
  
           o.println(s/div);
         
       }
  }
     //---------- I/O Template ----------
      public static void main(String[] args) { new Solution().run(); }
      void run() { 
          is = System.in; 
          o = new PrintWriter(System.out);
          solve();
          o.flush();
      }
      byte input[] = new byte[1024];
      int len = 0, ptr = 0;
      int readByte() { 
          if(ptr >= len) { ptr = 0; 
              try { len = is.read(input); } 
              catch(IOException e) { throw new InputMismatchException(); } 
              if(len <= 0) { return -1; } 
          } return input[ptr++];
      }
      boolean isSpaceChar(int c) { return !( c >= 33 && c <= 126 ); }
      int skip() { 
          int b = readByte(); 
          while(b != -1 && isSpaceChar(b)) { b = readByte(); } 
          return b;
      }
      char nc() { return (char)skip(); }
      String ns() { 
          int b = skip(); 
          StringBuilder sb = new StringBuilder(); 
          while(!isSpaceChar(b)) { sb.appendCodePoint(b); b = readByte(); } 
          return sb.toString();
      }
      String nLine() { 
          int b = skip(); 
          StringBuilder sb = new StringBuilder(); 
          while( !(isSpaceChar(b) && b != ' ') ) { sb.appendCodePoint(b); b = readByte(); } 
          return sb.toString();
      }
      int ni() { 
          int n = 0, b = readByte(); 
          boolean minus = false;
          while(b != -1 && !( (b >= '0' && b <= '9') || b == '-')) { b = readByte(); } 
          if(b == '-') { minus = true; b = readByte(); } 
          if(b == -1) { return -1; }  //no input 
          while(b >= '0' && b <= '9') { n = n * 10 + (b - '0'); b = readByte(); } 
          return minus ? -n : n;
      }
      long nl() { 
          long n = 0L;    int b = readByte(); 
          boolean minus = false; 
          while(b != -1 && !( (b >= '0' && b <= '9') || b == '-')) { b = readByte(); } 
          if(b == '-') { minus = true; b = readByte(); } 
          while(b >= '0' && b <= '9') { n = n * 10 + (b - '0'); b = readByte(); } 
          return minus ? -n : n;
      }
      double nd() { return Double.parseDouble(ns()); }
      float nf() { return Float.parseFloat(ns()); }
      int[] nia(int n) { 
          int a[] = new int[n]; 
          for(int i = 0; i < n; i++) { a[i] = ni(); } 
          return a;
      }
      long[] nla(int n) { 
          long a[] = new long[n]; 
          for(int i = 0; i < n; i++) { a[i] = nl(); } 
          return a;
      }
      int [][] nim(int n)
      {
          int mat[][]=new int[n][n];
          for(int i=0;i<n;i++)
          {
              for(int j=0;j<n;j++)
              {
                  mat[i][j]=ni();
              }
          }
          return mat;
      }
      long [][] nlm(int n)
      {
          long mat[][]=new long[n][n];
          for(int i=0;i<n;i++)
          {
              for(int j=0;j<n;j++)
              {
                  mat[i][j]=nl();
              }
          }
          return mat;
      }
      char[] ns(int n) { 
          char c[] = new char[n]; 
          int i, b = skip(); 
          for(i = 0; i < n; i++) { 
              if(isSpaceChar(b)) { break; } 
              c[i] = (char)b; b = readByte(); 
          } return i == n ? c : Arrays.copyOf(c,i);
      }
      void piarr(int arr[])
      {
          for(int i=0;i<arr.length;i++)
          {
              o.print(arr[i]+" ");
          }
          o.println();
      }
      void plarr(long arr[])
      {
          for(int i=0;i<arr.length;i++)
          {
              o.print(arr[i]+" ");
          }
          o.println();
      }
      void pimat(int mat[][])
      {
          for(int i=0;i<mat.length;i++)
          {
              for(int j=0;j<mat[0].length;j++)
              {
                  o.print(mat[i][j]+" ");
              }
              o.println();
          }
      }
      void plmat(long mat[][])
      {
          for(int i=0;i<mat.length;i++)
          {
              for(int j=0;j<mat[0].length;j++)
              {
                  o.print(mat[i][j]+" ");
              }
              o.println();
          }
      }
     static class DJset
  {
  int n;
  ty1 arr[];
  class ty1
  {
      int rank;
      int par;
      ty1(int p,int r)
      {
          par=p;
          rank=r;
      }
  }
  DJset(int nu)
  {
      n=nu;
      arr=new ty1[n];
      for(int i=0;i<n;i++)
      {
          arr[i]=new ty1(i,1);
      }
  }
  int find(int x)
  {
      if(arr[x].par!=x)
      {
          arr[x].par=find(arr[x].par);
      }
      return arr[x].par;
  }
  void union(int x,int y)
  {
      x=find(x);
      y=find(y);
      if(x!=y)
      {
          if(arr[x].rank<arr[y].rank)
          {
              arr[x].par=y;
          }
          else if(arr[y].rank<arr[x].rank)
          {
              arr[y].par=x;
          }
          else
          {
              arr[x].rank++;
              arr[y].par=x;
          }
      }
  }
  public String toString()
  {
      String res="";
      for(int i=0;i<n;i++)
      {
          res+=(arr[i].par+" ");
      }
      return res;
  }
  public int countsets()
  {
      int res=0;
      for(int i=0;i<n;i++)
      {
          if(arr[i].par==i)
          {
              res++;
          }
      }
      return res;
  }
  }
      //////////////////////////////////// template finished //////////////////////////////////////
  }