#include using namespace std; //repetition #define FOR(i,a,b) for(ll i=(a);i<(b);++i) #define rep(i, n) for(ll i = 0; i < (ll)(n); i++) //container util #define all(x) (x).begin(),(x).end() //typedef typedef long long ll; typedef vector VI; typedef vector VVI; typedef vector VLL; typedef vector VVLL; typedef vector VS; typedef pair PII; typedef pair PLL; //const value //const ll MOD = 1e9 + 7; //const int dx[] = {0,1,0,-1};//{0,0,1,1,1,-1,-1,-1}; //const int dy[] = {1,0,-1,0};//{1,-1,0,1,-1,0,1,-1}; //conversion inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;} inline ll toLL(string s) {ll v; istringstream sin(s);sin>>v;return v;} template inline string toString(T x) {ostringstream sout;sout<1){ mcnt--; v-=d[0]; d.erase(d.begin()); } ll num = 0; while(d.size()){ num = num*10+d.back(); d.pop_back(); } return v - num; } } int main(){ int n; string s; VI d; cin >> n; rep(i,n){ cin >> s; if(isdigit(s[0])) d.push_back(s[0]-'0'); if(s[0] == '+') p++; if(s[0] == '-') m++; } sort(all(d)); printf("%lld %lld\n",getmax(d),getmin(d)); return 0; }