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.

# # n = int(input())
# # arr = list(map(int,input().split()))
# # dic = {}
# # for i in range(n):
# # 	dic[arr[i]] = i
# # arr.sort()
# # ans = [0]*n
# # teams = []
# # temp = []
# # temp.append(arr[-1])
# # ans = 0
# # for i in range(n-2,-1,-1):
# # 	if len(temp)>2:
# # 		minn = abs(temp[-1]-temp[0])
# # 		x = abs(arr[i]-temp[0])
# # 		if x<minn:
# # 			minn = x
# # 			temp.append(arr[i])
# # 		else:
# # 			ans+=minn
# # 			teams.append(temp)
# # 			temp = [arr[i]]
# # 	else:
# # 		temp.append(arr[i])
# # if len(temp)<3:
# # 	ans-=abs(teams[-1][-1]-teams[-1][0])
# # 	teams[-1]+=temp
# # 	ans+=abs(teams[-1][-1]-teams[-1][0])
# # else:
# # 	teams.append(temp)
# # 	ans+=abs(temp[-1]-temp[0])
# # print(ans)
# # print(teams)
# # for _ in range(int(input())):
# # 	n = int(input())
# # 	arr = list(map(int,input().split()))
# # 	a = []
# # 	for i in range(n):
# # 		a.append(i+1)
# # 	ans = [0]*n
# # 	vis = [False]*n
# # 	temp = [0]*n
# # 	x = 0
# # 	v = 0
# # 	while x<n:
# # 		for i in range(n):
# # 			temp[arr[i]-1] = a[i]
# # 		v+=1
# # 		a = temp[:]
# # 		# print(a)
# # 		for i in range(n):
# # 			if a[i]-1==i:
# # 				if  not vis[i]:
# # 					ans[i] = v
# # 					vis[i] = True
# # 					x+=1
# # 	print(*ans)


# # from itertools import combinations
# # def search(arr,x,minn):
# # 	n = len(arr)
# # 	v = n//2
# # 	mid = arr[v]
# # 	if x==mid:
# # 		return mid
# # 	if n==1:
# # 		return minn
# # 	else:
# # 		if x>mid:
# # 			# print(mid)
# # 			# print(arr[v:])
# # 			return search(arr[v+1:],x,minn)
# # 		else:
# # 			minn = min(minn,mid)
# # 			return search(arr[:v+1],x,minn)
# # po = [1]
# # for i in range(1,10):
# # 	po.append(po[-1]*3)
# # tot = set()
# # for i in range(1,len(po)+1):
# # 	x = (list(combinations(po,i)))
# # 	for i in x:
# # 		tot.add(sum(list(i)))
# # tot = list(tot)
# # tot.sort()
# # # print(tot[:10])
# # for _ in range(int(input())):
# # 	n = int(input())
# # 	# for i in tot:
# # 	# 	if i>=n:
# # 	x = search(po,n,10**4)
# # 	print(x)
# 			# break

# # 1,3,4,9,10,12
# for _ in range(int(input())):
# 	n = int(input())
# 	arr = list(map(int,input().split()))
# 	tot = [arr]
# 	tot_in = [[1,n]]
# 	boo = False
# 	ans = []
# 	maxx = max(arr)
# 	maxi = arr.index(maxx)
# 	mini = arr[maxi-1]
# 	t = 2
# 	for i in range(maxi-1,-1,-1):
# 		if maxx-min(arr[i:maxi+1])>=len(arr[i:maxi+1]):
# 			# print("1")
# 			boo = True
# 			ans = [i+1,maxi+1]
# 			break
# 	if not boo:
# 		t = 2
# 		for i in range(maxi+1,n):
# 			if maxx-min(arr[maxi:i+1])>=len(arr[maxi:i+1]):
# 				boo = True
# 				# print("2")
# 				ans = [maxi+1,i+1]
# 				break

# 	if not boo:
# 		print("NO")
# 	else:
# 		print("YES")
# 		print(ans[0],ans[1])



n = int(input())
s = input()
a = [0,0]
for i in s:
	if i=='L':
		a[0]+=1
	else:
		a[1]+=1
print(sum(a)+1)

