[伯俊/BOJ]23797カエル[Slver 2](失敗)

#include <iostream>
#include <string>
using namespace std;

int main()
{
	string frog;
	int cnt, K_cnt = 0, P_cnt = 0;

	cin >> frog;

	for (int i = 0; i < frog.length(); i++)
	{
		if (frog[i] == 'K')
			K_cnt++;
		if (frog[i] == 'P')
			P_cnt++;
	}
	cnt=abs(K_cnt - P_cnt);

	cout << cnt+1;

	return 0;
}