correction assessment

import java.util.*;
import java.io.*;
import java.math.*;

class Solution {

    public static void main(String args[]) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        if (in.hasNextLine()) {
            in.nextLine();
        }
        String k = in.nextLine();
        String kChiff="";
        int bonneRep = 0;
        for(int i = 0; i < k.length(); i++)
        {
            kChiff += k.charAt(i)-'A';
        }
        for (int i = 0; i < n; i++)
        {
            String a = in.nextLine();
            if(a.charAt(kChiff.charAt(i)-'0') == 'X' && countXInString(a,'X') == 1)
                bonneRep++;
        }


        System.out.println(bonneRep*100/n);
    }
    public static int countXInString(String s, char x)
    {
        int res = 0;
        for(int i = 0; i < s.length(); i++)
        {
            if(s.charAt(i) == x)
                res++;
        }
        return res;
    }
}