#include <iostream>
#include <cmath>
using namespace std;
int main() {
long long n,cnt=0, lastTotal=0,current_consecutive=0,most_consecutive=0;
cin >> n; n -=1;
long long ti;
cin >> ti;
long long Current_type = ti;
for (long long i=1; i<=n ;i++) {
if (ti==Current_type) {
cnt++;
}
else {
lastTotal = cnt;
cnt=1;
Current_type=ti;
}
current_consecutive = min(cnt,lastTotal);
most_consecutive = max(most_consecutive,current_consecutive);
cin >> ti;
}
cnt++;
current_consecutive = min(cnt,lastTotal);
most_consecutive = max(most_consecutive,current_consecutive);
if (most_consecutive == 0) {
cout << 2 << endl;
}
else cout << most_consecutive *2<<endl;
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8Y21hdGg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmludCBtYWluKCkgewogICAgbG9uZyBsb25nIG4sY250PTAsIGxhc3RUb3RhbD0wLGN1cnJlbnRfY29uc2VjdXRpdmU9MCxtb3N0X2NvbnNlY3V0aXZlPTA7CiAgICBjaW4gPj4gbjsgbiAtPTE7CiAgICBsb25nIGxvbmcgdGk7CiAgICBjaW4gPj4gdGk7CiAgICBsb25nIGxvbmcgQ3VycmVudF90eXBlID0gdGk7CiAgICBmb3IgKGxvbmcgbG9uZyBpPTE7IGk8PW4gO2krKykgewogICAgICAgIGlmICh0aT09Q3VycmVudF90eXBlKSB7CiAgICAgICAgICAgIGNudCsrOwogICAgICAgIH0KICAgICAgICBlbHNlIHsKICAgICAgICAgICAgbGFzdFRvdGFsID0gY250OwogICAgICAgICAgICBjbnQ9MTsKICAgICAgICAgICAgQ3VycmVudF90eXBlPXRpOwogICAgICAgIH0KICAgICAgICBjdXJyZW50X2NvbnNlY3V0aXZlID0gbWluKGNudCxsYXN0VG90YWwpOwogCiAgICAgICAgbW9zdF9jb25zZWN1dGl2ZSA9IG1heChtb3N0X2NvbnNlY3V0aXZlLGN1cnJlbnRfY29uc2VjdXRpdmUpOwogICAgICAgIGNpbiA+PiB0aTsKICAgIH0KICAgIGNudCsrOwogICAgY3VycmVudF9jb25zZWN1dGl2ZSA9IG1pbihjbnQsbGFzdFRvdGFsKTsKICAgIG1vc3RfY29uc2VjdXRpdmUgPSBtYXgobW9zdF9jb25zZWN1dGl2ZSxjdXJyZW50X2NvbnNlY3V0aXZlKTsKICAgIGlmIChtb3N0X2NvbnNlY3V0aXZlID09IDApIHsKICAgICAgICBjb3V0IDw8IDIgPDwgZW5kbDsKICAgIH0KICAgIGVsc2UgY291dCA8PCBtb3N0X2NvbnNlY3V0aXZlICoyPDxlbmRsOwogICAgcmV0dXJuIDA7Cn0=