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.*;
  
  public class CF {
  	private static FS sc = new FS();
  	
  	private static class FS {
  		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
  		StringTokenizer st = new StringTokenizer("");
  		String next() {
  			while (!st.hasMoreTokens())
  				try {
  					st=new StringTokenizer(br.readLine());				               
  	            } catch (IOException e) {}
  			return st.nextToken();
  		}
  		
  		int nextInt() {
  			return Integer.parseInt(next());
  		}
  		long nextLong() {
  			return Long.parseLong(next());
  		}
  	}
  	
  	private static class extra {
  		
  		static int[] intArr(int size) {
  			int[] a = new int[size];
  			for(int i = 0; i < size; i++) a[i] = sc.nextInt();
  			return a;
  		}
  		
  		static long[] longArr(int size) {
  			long[] a = new long[size];
  			for(int i = 0; i < size; i++) a[i] = sc.nextLong();
  			return a;
  		}
  		
  		static long intSum(int[] a) {
  			long sum = 0; 
  			for(int i = 0; i < a.length; i++) {
  				sum += a[i];
  			}
  			return sum;
  		}
  		
  		static long longSum(long[] a) {
  			long sum = 0; 
  			for(int i = 0; i < a.length; i++) {
  				sum += a[i];
  			}
  			return sum;
  		}
  		
  		static LinkedList[] graphD(int vertices, int edges) {
  			LinkedList<Integer>[] temp = new LinkedList[vertices+1];
  			for(int i = 0; i <= vertices; i++) temp[i] = new LinkedList<>();
  			for(int i = 0; i < edges; i++) {
  				int x = sc.nextInt();
  				int y = sc.nextInt();
  				temp[x].add(y);
  			}
  			return temp;
  		}
  		
  		static LinkedList[] graphUD(int vertices, int edges) {
  			LinkedList<Integer>[] temp = new LinkedList[vertices+1];
  			for(int i = 0; i <= vertices; i++) temp[i] = new LinkedList<>();
  			for(int i = 0; i < edges; i++) {
  				int x = sc.nextInt();
  				int y = sc.nextInt();
  				temp[x].add(y);
  				temp[y].add(x);
  			}
  			return temp;
  		}
  		
  		static void printG(LinkedList[] temp) {
  			for(LinkedList<Integer> aa:temp) System.out.println(aa);
  		}
  		
  		static long cal(long val, long pow) {
  			if(pow == 0) return 1;
  			long res = cal(val, pow/2);
  			
  			long ret = (res*res)%mod;
  			if(pow%2 == 0) return ret;
  			return (val*ret)%mod;
  		}
  		
  		static long gcd(long a, long b) { return b == 0 ? a:gcd(b, a%b); }
  		
  	}
  	
  //	static int mod = (int) 1e9 + 7;
  	static int mod = (int) 998244353;
  	//static int max = (int) 1e6;//, sq = 316;
  	static LinkedList<Integer>[] temp;
  	
  	public static void main(String[] args) {
  		int t = sc.nextInt();
  //		int t = 1;
  		StringBuilder ret = new StringBuilder();
  		while(t-- > 0) {
  			int n = sc.nextInt(), s = sc.nextInt();
  			if(n == 1) {
  				ret.append(s + "\n");
  				continue;
  			}
  			int pos = n/2;
  			int to = pos+1;
  			int ans = s/to;
  			ret.append(ans + "\n");
  		}
  		System.out.println(ret);
  	}
  }
  
  
  
  
  