description: Alice and Bob are playing a game on a matrix, consisting of 2 rows and m columns. The cell in the i-th row in the j-th column contains a_{i, j} coins in it.
  
  Initially, both Alice and Bob are standing in a cell (1, 1). They are going to perform a sequence of moves to reach a cell (2, m).
  
  The possible moves are: 
  
    * Move right — from some cell (x, y) to (x, y + 1); 
    * Move down — from some cell (x, y) to (x + 1, y). 
  
  
  
  First, Alice makes all her moves until she reaches (2, m). She collects the coins in all cells she visit (including the starting cell).
  
  When Alice finishes, Bob starts his journey. He also performs the moves to reach (2, m) and collects the coins in all cells that he visited, but Alice didn't.
  
  The score of the game is the total number of coins Bob collects.
  
  Alice wants to minimize the score. Bob wants to maximize the score. What will the score of the game be if both players play optimally?
  
  Input
  
  The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of testcases.
  
  Then the descriptions of t testcases follow.
  
  The first line of the testcase contains a single integer m (1 ≤ m ≤ 10^5) — the number of columns of the matrix.
  
  The i-th of the next 2 lines contain m integers a_{i,1}, a_{i,2}, ..., a_{i,m} (1 ≤ a_{i,j} ≤ 10^4) — the number of coins in the cell in the i-th row in the j-th column of the matrix.
  
  The sum of m over all testcases doesn't exceed 10^5.
  
  Output
  
  For each testcase print a single integer — the score of the game if both players play optimally.
  
  Example
  
  Input
  
  
  3
  3
  1 3 7
  3 5 1
  3
  1 3 9
  3 5 1
  1
  4
  7
  
  
  Output
  
  
  7
  8
  0
  
  Note
  
  The paths for the testcases are shown on the following pictures. Alice's path is depicted in red and Bob's path is depicted in blue.
  
  <image>
solution: import java.util.*;
  import java.io.*;
  public class Ait
  {
  	
  	public static void process()throws IOException
  	{
  		int n=I();
  		int b[][]=new int[2][n];
  		   for(int i=0;i<2;i++)
  		   {
  			   for(int j=0;j<n;j++)
  			   {
  				   b[i][j]=I();
  			   }
  		   }
  		if(n==1)
  		{
  			pn(0);
  			return;
  		}
  	  
  	   
  	   long dp1[]=new long[n];
  	   long dp2[]=new long[n];
  	   dp2[0]=b[1][0];dp1[n-1]=b[0][n-1];
  	   for(int i=1;i<n;i++)
  	   {
  		   dp2[i]=dp2[i-1]+b[1][i];
  	   }
  	   for(int i=n-2;i>=0;i--)
  	   {
  		   dp1[i]=dp1[i+1]+b[0][i];
  	   }
  	  
  	  long min=Long.MAX_VALUE;
  	  for(int i=1;i<n-1;i++)
  	  {
  		  min=Math.min(Math.max(dp1[i+1], dp2[i-1]), min);
  	  }
  	  min=Math.min(dp1[1], min);
  	  min=Math.min(dp2[n-2], min);
  		pn(min);
  }
  	static Scanner sc = new Scanner(System.in);
  	static PrintWriter out = new PrintWriter(System.out);
  	static void pn(Object o){out.println(o);out.flush();}
  	static void p(Object o){out.print(o);out.flush();}
  	static void pni(Object o){out.println(o);System.out.flush();}
  	static int I() throws IOException{return sc.nextInt();}
  	static long L() throws IOException{return sc.nextLong();}
  	static double D() throws IOException{return sc.nextDouble();}
  	static String S() throws IOException{return sc.next();}
  	static char C() throws IOException{return sc.next().charAt(0);}
  	static int[] Ai(int n) throws IOException{int[] arr = new int[n];for (int i = 0; i < n; i++)arr[i] = I();return arr;}
  	static String[] As(int n) throws IOException{String s[] = new String[n];for (int i = 0; i < n; i++)s[i] = S();return s;}
  	static long[] Al(int n) throws IOException {long[] arr = new long[n];for (int i = 0; i < n; i++)arr[i] = L();return arr;}
  	static void dyn(int dp[][],int n,int m,int z)throws IOException {for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ dp[i][j]=z;}} }
  	
  //	*--------------------------------------------------------------------------------------------------------------------------------*//
  	static class AnotherReader {BufferedReader br;StringTokenizer st;AnotherReader() throws FileNotFoundException {br = new BufferedReader(new InputStreamReader(System.in));}
  	AnotherReader(int a) throws FileNotFoundException {br = new BufferedReader(new FileReader("input.txt"));}
  	String next() throws IOException{while (st == null || !st.hasMoreElements()) {try {st = new StringTokenizer(br.readLine());} catch (IOException e) {e.printStackTrace();}}return st.nextToken();}
  	int nextInt() throws IOException {return Integer.parseInt(next());}
  	long nextLong() throws IOException {return Long.parseLong(next());}
  	double nextDouble() throws IOException {return Double.parseDouble(next());}
  	String nextLine() throws IOException {String str = "";try {str = br.readLine();} catch (IOException e) {e.printStackTrace();}return str;}}
  	public static void main(String[] args)throws IOException{try{boolean oj=true;if(oj==true)
  	{AnotherReader sk=new AnotherReader();PrintWriter out=new PrintWriter(System.out);}
  	else
  	{AnotherReader sk=new AnotherReader(100);out=new PrintWriter("output.txt");}
  	long T=L();while(T-->0)
  	{process();}out.flush();out.close();}catch(Exception e){return;}}}
  //*-----------------------------------------------------------------------------------------------------------------------------------*//
  	