#include <cstdio>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <climits>
#include <ctime>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <set>
#include <map>
#include <iostream>
#include <deque>
#include <complex>
#include <string>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <valarray>
#include <iterator>
using namespace std;
typedef long long int ll;
typedef unsigned int uint;
typedef unsigned char uchar;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;

#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)
#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)
#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)
#define ALL(container) container.begin(), container.end()
#define RALL(container) container.rbegin(), container.rend()
#define SZ(container) ((int)container.size())
#define mp(a,b) make_pair(a, b)
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"["; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"]"; return os;
}
template<class T> ostream& operator<<(ostream &os, const set<T> &t) {
os<<"{"; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"}"; return os;
}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}

const int INF = 1<<28;
const double EPS = 1e-8;
const int MOD = 1000000007;


int n;
string s;
int parse(int &p, int d);

int num(int &p){
	int res = 0;
	if(p>=s.size()) throw 0;
	if(s[p] == '('){
		res = parse(++p, 4);
		if(p>=s.size() || s[p++] != ')') throw 0;
	}else{
		if(!isdigit(s[p]) || s[p] == '0') throw 0;
		for(;isdigit(s[p]);++p) res = res*10+s[p]-'0';
	}
	return res;
}

int parse(int &p, int d=4){
	int res = d?parse(p, d-1) : num(p);
	while(p<s.size()){
		if(d == 0 && s[p] == '*'){
			res *= num(++p);
		}else if(d == 1 && s[p] == '+'){
			res += parse(++p, 0);
		}else if(d == 1 && s[p] == '-'){
			res -= parse(++p, 0);
		}else if(d == 2 && s[p] == '&'){
			res &= parse(++p, 1);
		}else if(d == 3 && s[p] == '^'){
			res ^= parse(++p, 2);
		}else if(d == 4 && s[p] == '|'){
			res |= parse(++p, 3);
		}else break;
	}
	return res;
}
int Min(string t, int rest);

string tbl = "()*+-&^|0123456789";
int Max(string t, int rest){
	s = t;
	int p = 0;
	int res = -INF;
	if(rest == 0) return parse(p);
	REP(i, t.size()+1)REP(j, tbl.size()){
		s = t;
		s.insert(s.begin()+i, tbl[j]);
		int f = 1;
		try{
			int p=0;
			parse(p);
			if(p!=s.size()) throw 0;
		}catch(...){
			f = 0;
		}
		if(f) res = max(res, Min(s, rest-1));
	}
	REP(i, t.size()){
		s = t;
		s.erase(s.begin()+i);
		int f = 1;
		try{
			int p=0;
			parse(p);
			if(p!=s.size()) throw 0;
		}catch(...){
			f = 0;
		}
		
		if(f) res = max(res, Min(s, rest-1));
	}
	return res;
}

int Min(string t, int rest){
	s = t;
	int p = 0;
	int res = INF;
	if(rest == 0) return parse(p);
	REP(i, t.size()+1)REP(j, tbl.size()){
		s = t;
		s.insert(s.begin()+i, tbl[j]);
		int f = 1;
		try{
			int p=0;
			parse(p);
			if(p!=s.size()) throw 0;
		}catch(...){
			f = 0;
		}
		
		if(f) res = min(res, Max(s, rest-1));
	}
	REP(i, t.size()){
		s = t;
		s.erase(s.begin()+i);
		int f = 1;
		try{
			int p=0;
			parse(p);
			if(p!=s.size()) throw 0;
		}catch(...){
			f = 0;
		}
		
		if(f) res = min(res, Max(s, rest-1));
	}
	return res;
}

main(){
	string s;
	while(cin >> n >> s, n){
		int ans;
		int p = 0, res = -1;
		while(n>2) n-=2;
		cout << Max(s, n) << endl;
	}
	return 0;
}

Measured memory_bytes: 1292