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.*;

public class Main {


    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        sc.nextLine();
        String s = sc.nextLine();
        int r=0;
        int l=0;
        for (char c :s.toCharArray()){
            if (c=='R')r++;
            else l++;
        }
        System.out.println(r+l+1);
    }

    private static void solve(int[] a, int b, int idx) {
        int res = 0 ;
        Arrays.sort(a);
        int spend = 0;
        for(int i = 0; i < a.length; i++) {
            spend += a[i];
            if (spend <= b) {
                res++;
            } else {
                break;
            }
        }
        System.out.println("Case #"+idx+": " +res);
    }

}

/**
 * B W B
 * B W B
 * B W W
 * B W W
 *
 * 5 * (3 / 2 + 1
 * B W
 * B W
 * B B
 * B B
 *
 *
 * B W B W
 * W W B B
 * B W B B
 *
 * B W B W B
 * B W B W W
 * B W B W B
 *
 */

/**
 *
 *  1,2,3
 **/