시간 제한메모리 제한제출정답맞힌 사람정답 비율
2 초 (추가 시간 없음) 512 MB222100.000%

## 문제

Ania and Tomek have recently fallen in love. They are texting each other all the time. We can assume that each such message is a binary sequence. Tomek's father, Maksymilian, is not very keen on this whole situation. He decided to capture one of the lovers message and change it to his desired message, both this messages have the same length. He has to do it as fast as he can, because he doesn't want to gain unnecessary attention. Maksymilian can make three types of operations:

• change $0$ to $1$ on some fixed position,
• change $1$ to $0$ on some fixed position,
• swap the bits on two fixed neighbouring positions.

Each of this operations take some time. The first one takes $t_0$ seconds, the second one $t_1$ seconds and the third one $t_s$ seconds. Father can use any operation multiple times (possibly zero) and would like to change the given message into the desired one as fast as possible. Help him!

## 입력

In the first line one integer $Z \le 20$ is given, denoting number of testcases described in following lines.

To compress the size of the input, all the binary sequences are converted into hexadecimal ones, so you may assume that the length of each such binary sequence is divisible by four.

The first line of the each test case contains four natural numbers $n, t_0, t_1, t_s$ meaning the length of the hexadecimal sequences and the times described in the task description. The second line contains the message father got and the third line contains the message that father is going to make. This sequences consist of only characters from the set {0, 1, ..., 9, A, B, ..., F}.

## 출력

The first and only line of the output for each test case should contain one integer meaning the minimal number of seconds needed to change the first sequence into the second one.

## 제한

• $n \in [1, 10^6]$
• $t_0, t_1, t_s \in [1, 10^{12}]$

## 예제 입력 1

2
2 1 2 3
F0
D5
3 1 1 1
201
110


## 예제 출력 1

4
3


## 힌트

In the first example the decoded binary sequences are 11110000 and 11010101.