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.
	//package codeforces;
	
	import java.util.Scanner;
	import java.util.HashMap;
	import java.util.HashSet;
	import java.util.LinkedList;
	import java.util.TreeMap;
	import java.util.TreeSet;
	import java.math.BigInteger;
	import java.util.ArrayList;
	import java.util.Arrays;
	import java.util.Collections;
	import java.util.Stack;
	import java.util.Set;
	
	public class q {
		static Scanner scn = new Scanner(System.in);
		static int mod = 1000000007;
		static int count = 0;
	
		public static void main(String[] args) {
			
			
			int n=scn.nextInt();
			String str=scn.next();
			int a=0,b=0;
			for(int i=0;i<n;i++)
			{
				if(str.charAt(i)=='L')
					a++;
				else
					b++;
			}
			System.out.println(a+b+1);
			
	}
		
		public static long gcd(long a, long b) {
			if (a == 0)
				return b;
			long l = gcd(b % a, a);
			return l;
		}
	
		public static void permu(String str, String ans) {
			if (str.length() == 0) {
				System.out.println(ans + " ");
				return;
			}
	
			for (int i = 0; i < str.length(); i++) {
				char ch = str.charAt(i);
				String res = str.substring(0, i) + str.substring(i + 1);
				permu(res, ans + ch);
	
			}
		}
		public static String factorial(int n) {
			BigInteger fact = new BigInteger("1");
			for (int i = 1; i <= n; i++) {
				fact = fact.multiply(new BigInteger(i + ""));
			}
			return fact.toString();
		}
	
	}
