



import java.util.*;
import java.lang.*;
import java.lang.reflect.Array;
import java.io.*;
import java.math.*;
import java.util.HashMap;
import java.io.BufferedReader; 
import java.io.FileReader; 
import java.io.IOException; 
import java.io.InputStreamReader; 
import java.util.StringTokenizer; 
import java.io.DataInputStream; 
import java.io.FileInputStream; 
import java.math.BigInteger;
import java.text.DecimalFormat;
import java.util.BitSet;

public class Prac{   
    static int arr[]=new int[100000],j=0;
    static boolean isPrime(long a){
      long i=a/2;
      if(a==2)
          return true;
      while(i>1){
          if(a%i==0)
              return false;
          i--;
      }
      return true;
  }
    static void findPrimes(){
       
        for(int i=2;i<100000;i++){
            if(isPrime(i)){
                arr[j++]=i;
            }
        }
    }
    static class InputReader {
 
		private final InputStream stream;
		private final byte[] buf = new byte[8192];
		private int curChar, snumChars;
 
		public InputReader(InputStream st) {
			this.stream = st;
		}
 
		public int read() {
			if (snumChars == -1)
	 			throw new InputMismatchException();
			if (curChar >= snumChars) {
				curChar = 0;
				try {
					snumChars = stream.read(buf);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (snumChars <= 0)
					return -1;
			}
			return buf[curChar++];
		}
 
		public int ni() {
			int c = read();
			while (isSpaceChar(c)) {
				c = read();
			}
			int sgn = 1;
			if (c == '-') {
				sgn = -1;
				c = read();
			}
			int res = 0;
			do {
				res *= 10;
				res += c - '0';
				c = read();
			} while (!isSpaceChar(c));
			return res * sgn;
		}
 
		public long nl() {
			int c = read();
			while (isSpaceChar(c)) {
				c = read();
			}
			int sgn = 1;
			if (c == '-') {
				sgn = -1;
				c = read();
			}
			long res = 0;
			do {
				res *= 10;
				res += c - '0';
				c = read();
			} while (!isSpaceChar(c));
			return res * sgn;
		}
 
		public int[] nia(int n) {
			int a[] = new int[n];
			for (int i = 0; i < n; i++) {
				a[i] = ni();
			}
			return a;
		}
 
		public String rs() {
			int c = read();
			while (isSpaceChar(c)) {
				c = read();
			}
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = read();
			} while (!isSpaceChar(c));
			return res.toString();
		}
 
		public String nextLine() {
			int c = read();
			while (isSpaceChar(c))
				c = read();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = read();
			} while (!isEndOfLine(c));
			return res.toString();
		}
 
		public boolean isSpaceChar(int c) {
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}
 
		private boolean isEndOfLine(int c) {
			return c == '\n' || c == '\r' || c == -1;
		}
 
	}
    static PrintWriter w = new PrintWriter(System.out);
    public static void main(String[] args) throws IOException {   
        InputReader sc=new InputReader(System.in);
        
        int t=sc.ni();
        while(t-->0){
            int n=sc.ni();
            String s=sc.nextLine();
           // char arr[]=new char[n];
            ArrayList<Character> arr=new ArrayList<Character>();
            //arr=s.toCharArray();
            for(int i=0;i<n;i++){
                arr.add(s.charAt(i));
            }
            boolean found=false;
            int count=0;
            while(!found){
                 found=true;
                for(int i=0;i<n;i++){
                   
                    if(arr.get(i)=='<'&&i>0){
                        int j=i-1;
                        while(arr.get(j)=='.'){
                            j--;   
                            if(j<0)
                                break;
                        }
                        if(j>=0){
                            arr.set(j,'.');
                            found=false;
                            count++;
                        }
                    }
                    else if(arr.get(i)=='>'&&i<n-1){
                        int j=i+1;
                        while(arr.get(j)=='.'){
                            j++;
                            if(j>n-1)
                                break;
                        }
                        if(j<n){
                            arr.set(j,'.');
                            found=false;
                            count++;
                        }
                    }
                }
                if(count==n-1)
                    found=true;
                
            
            }
            count=0;
            for(int i=0;i<n;i++){
                    if(arr.get(i)=='>'||arr.get(i)=='<')
                        count++;
                }
             w.println(count-1);
        }
        
        
      
        w.close();
    }
}
