you give string s1 dot n consist lowercase latin letter it guarantee n 2k integer k ge 0The string s1 dot n call cgood follow condition satisfy the length s 1 consist character c ie s_1c the length s great 1 half string consist character c ie s_1s_2dotss_fracn2c second half string ie string s_fracn2 1s_fracn2 2 dot s_n c1good stre the length s great 1 second half string consist character c ie s_fracn2 1s_fracn2 2dotss_nc half stre ie string s_1s_2 dot s_fracn2 c1good string for example aabc agood ffgheeee egoodIn choose index 1 n replace s_i lowercase latin letter character zYour task find minimum number move require obtain agood string s ie cgood string c it guarantee answer existsyou answer t independent test casesanother example agood string follow consider string s cdbbaaaa it agood string second half string aaaa consist character half string cdbb bgood string second half string bb consist character b half string cd cgood string half string c consist character c second half string d dgood string