import java.io.*; import java.util.*; public class n1{ public static int[] solve(int a){ if(a==1){ return new int[]{1,1}; } for(int i=2;i<=a;i++){ if(a%i==0){ int count=0; while(a>1){ a/=i; count++; } return new int[]{i,count}; } } System.out.println("ERROR"); return null; } static int p; static int n; static int bestValue; public static void main(String[] args) throws Exception{ int i=I.readInt(); int[] q=solve(i); p=q[0]; n=q[1]; String s=I.readLine(); int[] values=new int[26]; int c=I.readInt(); for(int ii=0;ii=0) { if(must==-1) { must=id[i]; }else if(id[i]!=must){ ok=false; break; } } } int valueAll=0; if(ok) { int val=bestValue; if(must!=-1) { val=values[must]; } valueAll = val*id.length/skip*(n+1-pow); } // Solve problems below instead int valueSplit = 0; for(int i=0;i