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 \le n \le 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$.

Difficulty: interview

Starter code:

Solutions:
n = int(input())
l = input()
print(n+1)


n = int(input())
s = input()
print(n + 1)


n = int(input())
s = input()
l = 0
r = 0
for c in s:
    if c == 'L':
        l -= 1
    else:
        r += 1
print(r - l + 1)

n = int(input())
s = input()
a = s.count("L")
b = s.count("R")
print(a+b+1)

n = int(input())
s = input()
l = s.count("L")
r = n-l
print(l+r+1)


n = int(input())
a = input()
print(n + 1)


print (str(int(input())+1))

# -*- encoding: utf-8 -*-
import sys
r_input = sys.stdin.readline

n = int(r_input())
s = r_input().rstrip()
print(s.count('L') + s.count('R') + 1)

print(int(input())+1)


n=int(input())
print(n+1)

n = int(input())
a = input()
print(a.count('L') + a.count('R') + 1)


n =  int(input())
k = input()
print(n+1)

n = int(input())
s = input()
print(s.count('L') + s.count('R') + 1)

import sys
import math
import heapq
import bisect
import re
from collections import deque
from decimal import *
from fractions import gcd
 
sys.setrecursionlimit(1000000000)
def input():
    return sys.stdin.readline().strip()
 
def iinput():
    return int(input())
 
def finput():
    return float(input())
 
def tinput():
    return input().split()
 
def rinput():
    return map(int, tinput())
 
def rlinput():
    return list(rinput())
 
def modst(q, s):
    res = 1
    while s:
        if s % 2:
            res *= q
        q *= q
        s //= 2
    return res

def main():
    # [int(i) for i in sys.stdin.readline().split()]
    n = int(sys.stdin.readline())
    e = list(sys.stdin.readline())
    print(n + 1)
    
main()

n = int(input())
s = input()
print(s.count('L')+s.count('R')+1)


import sys
import math
import itertools
import functools
import collections
import operator


def ii(): return int(input())
def mi(): return map(int, input().split())
def li(): return list(map(int, input().split()))
def lcm(a, b): return abs(a * b) // math.gcd(a, b)
def wr(arr): return ' '.join(map(str, arr))
def revn(n): return str(n)[::-1]
def dd(): return collections.defaultdict(int)
def ddl(): return collections.defaultdict(list)
def sieve(n):
    if n < 2: return list()
    prime = [True for _ in range(n + 1)]
    p = 3
    while p * p <= n:
        if prime[p]:
            for i in range(p * 2, n + 1, p):
                prime[i] = False
        p += 2
    r = [2]
    for p in range(3, n + 1, 2):
        if prime[p]:
            r.append(p)
    return r
def divs(n, start=1):
    r = []
    for i in range(start, int(math.sqrt(n) + 1)):
        if (n % i == 0):
            if (n / i == i):
                r.append(i)
            else:
                r.extend([i, n // i])
    return r
def divn(n, primes):
    divs_number = 1
    for i in primes:
        if n == 1:
            return divs_number
        t = 1
        while n % i == 0:
            t += 1
            n //= i
        divs_number *= t
def prime(n):
    if n == 2: return True
    if n % 2 == 0 or n <= 1: return False
    sqr = int(math.sqrt(n)) + 1
    for d in range(3, sqr, 2):
        if n % d == 0: return False
    return True
def convn(number, base):
    newnumber = 0
    while number > 0:
        newnumber += number % base
        number //= base
    return newnumber
def cdiv(n, k): return n // k + (n % k != 0)


n = ii()
s = input()
print(n+1)

n = int(input())
print(n + 1)


n = int(input())
string = str(input())
print(n + 1)

n=int(input())
s=input()
x=s.count("L")
print(x+n-x+1)


n = int(input())
a = input()
print(a.count('L') + a.count('R') + 1)

from collections import deque
import itertools
import operator
import queue
import time
import math
import sys
import os

# map(int, input().split())
# list(map(int, input().split()))
# [list(map(int, input().split())) for I in range(n)]

##############################################################


n = int(input())
s = str(input())

print(len(s) + 1)


def main():
    n = int(input())
    s = input()
    left = 0-s.count('L')
    right = 0+s.count('R')

    print(right-left+1)

main()