Today, Mezo is playing a game. Zoma, a character in that game, is initially at position x = 0. Mezo starts sending n commands to Zoma. There are two possible commands:

  * 'L' (Left) sets the position x: =x - 1; 
  * 'R' (Right) sets the position x: =x + 1. 



Unfortunately, Mezo's controller malfunctions sometimes. Some commands are sent successfully and some are ignored. If the command is ignored then the position x doesn't change and Mezo simply proceeds to the next command.

For example, if Mezo sends commands "LRLR", then here are some possible outcomes (underlined commands are sent successfully): 

  * "LRLR" — Zoma moves to the left, to the right, to the left again and to the right for the final time, ending up at position 0; 
  * "LRLR" — Zoma recieves no commands, doesn't move at all and ends up at position 0 as well; 
  * "LRLR" — Zoma moves to the left, then to the left again and ends up in position -2. 



Mezo doesn't know which commands will be sent successfully beforehand. Thus, he wants to know how many different positions may Zoma end up at.

Input

The first line contains n (1 ≤ n ≤ 10^5) — the number of commands Mezo sends.

The second line contains a string s of n commands, each either 'L' (Left) or 'R' (Right).

Output

Print one integer — the number of different positions Zoma may end up at.

Example

Input


4
LRLR


Output


5

Note

In the example, Zoma may end up anywhere between -2 and 2.
import java.util.*;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class a{
     static int[] count;
     // static int[] count1;
     static long[] arr;
     static char[] c;
     static long[] darr;
     static long x;
     static long maxl;
     static double dec;
     // static long minl;
     static int mx = (int)1e6;
     static long mod = 998244353l;
     // static int minl = -1;
     static int n;
     // static long n;
     static long a;
     static long b;
     // static long c;
     static long d;
     static long y;
     static int m;
     static long k;
     static String[] str;
     static Set<Long> set;
     static Set<Integer> list;
     static Map<Long,Integer> map;
     static StringBuilder sb;

     public static void solve(){

        long r = 0;
        long l = 0;
        for(int i = 0 ; i <  n; i++){
            if(c[i] == 'R')
                r += 1;
            else
                l -= 1;
        }

        System.out.println(r-l+1);

     }

     public static void main(String[] args) {

            // FastScanner sc = new FastScanner();
            Scanner sc = new Scanner(System.in);
            int t = 1;
            while(t > 0){
                 // set = new HashSet<>();
                 // map = new HashMap<>();
                
                // x = sc.nextLong();
                // y = sc.nextLong();
                // a = sc.nextLong();
                // b = sc.nextLong();
                
                // c = sc.nextLong();
                // d = sc.nextLong();

                 // long x = sc.nextLong();

                 // maxl = Integer.MIN_VALUE;

                // arr = new long[3];
                // for(int i = 0; i < 3 ; i++){
                //     arr[i] = sc.nextLong();
                // }
                n = sc.nextInt();
                // m = sc.nextInt();
                // dec = sc.nextDouble();
                // n = sc.nextLong();
                 // d = sc.nextLong();
                //  // x = sc.nextLong();
                //  // a = sc.nextInt();
                //  // b = sc.nextInt();
                 // m = sc.nextLong();
                 // k = sc.nextLong();
                 // k = sc.nextInt();
                 // // x = sc.nextInt();
                // a = sc.next().toCharArray();
                //  b = sc.next().toCharArray();
                 c = sc.next().toCharArray();
                 
                 // n = c.length;

                 // // // k = sc.nextInt();
                 
                // arr = new long[n];
                // for(int i = 0; i < n ; i++){
                //     arr[i] = sc.nextLong();
                // }

                

                 // darr = new long[n];
                 // for(int i = 0; i < n ; i++){
                 //     darr[i] = sc.nextLong();
                 // }
                 // boolean flag = false;
                // str = new String[n];
                // for(int i = 0 ; i < n ; i++){
                //     str[i] = sc.next();
                // }

                 // x = sc.nextInt();



                // System.out.println(solve()?"YES":"NO");
                solve();
                 // System.out.println(solve());
                 // sb = new StringBuilder();
                 // sb.append(str);

                 t -= 1;
            }

     }

    public static int log(long n){
         if(n == 0)
             return 0;

         if(n == 1)
             return 0;
         if(n == 2)
             return 1;
         double num = Math.log(n);
         double den = Math.log(2);
         if(den == 0)
             return 0;
         return (int)(num/den);
     }

     public static void swap(int i,int j){
         long temp = arr[j];
         arr[j] = arr[i];
         arr[i] = temp;
     } 

    static final Random random=new Random();
    
    static void ruffleSort(long[] a) {
        int n=a.length;//shuffle, then sort 
        for (int i=0; i<n; i++) {
            int oi=random.nextInt(n);
            long temp=a[oi];
            a[oi]=a[i]; a[i]=temp;
        }
        Arrays.sort(a);
    }

    static class Node{
        int first;
        int second;
        Node(int f,int s){
            this.first = f;
            this.second = s;
        }
    }

     static class FastScanner {

                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) {
                                        e.printStackTrace();
                                }
                        return st.nextToken();
                }
                
                int nextInt() {
                        return Integer.parseInt(next());
                }
                int[] readArray(int n) {
                        int[] a=new int[n];
                        for (int i=0; i<n; i++) a[i]=nextInt();
                        return a;
                }
                long nextLong() {
                        return Long.parseLong(next());
                }
        }

}