# #3018. [Usaco2012 Nov]Distant Pastures

#### 题目描述

Farmer John's farm is made up of an N x N grid of pastures, where each pasture contains one of two different types of grass. To specify these two types of grass, we use the characters ( and ), so for example FJ's farm might look like the following grid:
(())
)()(
)(((
))))
When Bessie the cow travels around the farm, it takes her A units of time to move from a pasture to an adjacent pasture (one step north, south, east, or west) with the same grass type, or B units of time to move to an adjacent pasture with a different grass type. Whenever Bessie travels from one pasture to a distant pasture, she always uses a sequence of steps that takes the minimum amount of time. Please compute the greatest amount of time Bessie will ever need to take while traveling between some pair of pastures on the farm.

#### 输入格式

1 <= n <= 30，1 <= A <= 1,000,000，1 <= B <= 1,000,000。

一个整数，最大的D(S,T)。

#### 样例输入

``````
3 1 2
(((
()(
(()``````

#### 样例输出

``````
5
样例说明