package chelper;

import java.util.Arrays;

import io.InputReader;
import io.OutputWriter;

public class TaskD {
  public void solve(int testNumber, InputReader in, OutputWriter out) {
    int n = in.nextInt();
    char[] a = in.nextString().toCharArray();

    char c1 = 'V';
    char c2 = 'K';

    int[][] dp = new int[n][3];
    for (int i = 0; i < n; i++) {
      Arrays.fill(dp[i], 100000);
    }

    if (a[0] == c1) {
      dp[0][0] = 0;
    } else if (a[0] == c2) {
      dp[0][1] = 0;
    } else {
      dp[0][2] = 0;
    }

    for (int i = 1; i < n; i++) {
      if (a[i] == c1) {
        dp[i][2] = Math.min(dp[i][2], dp[i - 1][0]);
        dp[i][2] = Math.min(dp[i][2], dp[i - 1][1]);
        dp[i][2] = Math.min(dp[i][2], dp[i - 1][2]);
      } else if (a[i] == c2) {

      } else {
        dp[i][2] = Math.min(dp[i][2], dp[i - 1][0]);
        dp[i][2] = Math.min(dp[i][2], dp[i - 1][1]);
        dp[i][2] = Math.min(dp[i][2], dp[i - 1][2]);
      }
    }
  }
}