Use dev C++

Lost Encryptor Jojo is on a secret mission. His task involves communicating to his upper echelon of the country. As their messages are crucial, the messages needs to be encrypted. But, when Jojo is a busy doing secret agent stuff, he accidentally lost his encryptor array. The encryptor is an array permutation of 1..N. Fortunately, he remembered word S and its encryption, denoted by T. Thus, he asks you to build him a program to recover his encryptor. The table below illustrates how Jojo's encryptor work. word bin uso= njuis ob encryptor 7 41 3 5 6 2 1 2 3 4 5 6 7 Table 1: Jojo's encryptor Format Input The first line will contain N which denotes the length of the word. The next line will contain S, the original word. The last line will be T, the encrypted S. T will be the permutation of S. It is guaranteed that S is a heterogram and will only contain lowercase letters. Heterogram is a word in which all of it letters are unique. Format Output The output of this problem will be the encryptor array of S which results in T. Each numbers are seperated by a single space. Beware of trailing spaces. Constraints 1<>