import java.io.*; import java.util.*; import java.text.*; import java.math.*; import java.util.regex.*; public class Solution { static int minimumNumber(int j, String st) { char ch; int i,k,l,in=0,c=0,C=0,sp=0,su=0; for(i=0;i=48&&k<=57) ++in; if(k>=97&&k<=122) ++c; if(k>=65&&k<=90) ++C; if(k==33||k==64||k==35||k==36||k==37||k==91||k==38||k==42||k==40||k==41||k==95||k==43) ++sp; } if(in==0) ++su; if(c==0) ++su; if(C==0) ++su; if(sp==0) ++su; if((j+su)<6) su=su+(6-(j+su)); return su; // Return the minimum number of characters to make the password strong } public static void main(String[] args) { char ch; int i,j,k,l,in=0,c=0,C=0,sp=0,su=0; Scanner sc= new Scanner(System.in); String st; System.out.println("b"); st=sc.nextLine(); if(j>=1&&j<=100) { st=sc.nextLine(); su= minimumNumber(j,st); System.out.println(su); } } }