def Game$($Str$,$ N$)$: # Calculate the initial displacement initial$\_$displacement $=$ Str$.$count$(\text{'}$S$\text{'})-$ Str$.$count$(\text{'}$R$\text{'})$ # Count the number of $\text{'}$R$\text{'}$ in the string count$\_$R $=$ Str$.$count$(\text{'}$R$\text{'})$ # Maximum changes possible is either all $\text{'}$R$\text{'}$ or exactly N changes changes$\_$possible $=$ min$($count$\_$R$,$ N$)$ # Calculate the maximum possible displacement after changes max$\_$displacement $=$ initial$\_$displacement $+2*$ changes$\_$possible # If not all N changes were used for $\text{'}$R$\text{'},$ return the max possible with necessary N if count$\_$R $<$ N: # If less $\text{'}$R$\text{'}$ than N$,$ next best displacement might be less by unused $\text{'}$N$\text{'}$ max$\_$displacement $=$ max$\_$displacement $-($N $-$ count$\_$R$)$ return max$\_$displacement # Example usage with input: Str $="$SSSRSSS$"$ N $=2$ print$($Game$($Str$,$ N$))$ # Expected Output: $6$