# LAZY GOPAL SOLUTIONS BVPCSI01

Page Contents

### LAZY GOPAL SOLUTIONS BVPCSI01

Your companion Gopal is a fighter and he gets orders from his sergeant. He gets N orders. Orders are of 2 sorts: ‘L′(Left) sets the position x:=x−1 ′R′ (Right) sets the position x:=x+1. Envision Gopal is remaining at x=0 on the number line at first. Gopal is remarkably drained from his past drills so he here and there guilefully avoids a few orders. On the off chance that the order is overlooked by Gopal, Then the position x doesn’t change and Gopal essentially continues to the following order.

For instance, in the event that Gopal is old “LRLR”, at that point here are some potential results (italics orders are executed effectively):

“LRLR” — He moves to one side, to one side, to one side again and to one side for the last time, winding up at position 0.

“LRLR” — He doesn’t move at all and winds up at position 0 too.

“LRLR” — He moves to one side, at that point to one side again and winds up in position −2.

You don’t have the foggiest idea about the orders which will be effectively executed by him already. In this manner, he needs to know what number of various positions may he wound up at.

Info:

The principal line contains n — the quantity of orders sergeant sends.

The subsequent line contains a string s of n orders, each either ′L′ (Left) or ′R′ (Right).

Yield:

Print one whole number — the quantity of various positions Gopal may wind up at.

Limitations

(1<=n<=105)

Test Input:

LRLR

Test Output:

Clarification:

He may wind up anyplace somewhere in the range of −2 and 2.