#define _USE_MATH_DEFINES #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define rep(i,n) for(int i=0;i<(n);i++) #define REP(i,a,n) for(int i=a;i<(n);i++) #define rrep(i,n) for(int i=(n)-1;i>=0;i--) #define VI vector #define VS vector #define all(a) (a).begin(),(a).end() #define debug(x) cout<<#x<<": "< P; class ParseError {}; const ll INF=1LL<<50; char fi[101][101]; int day[12]={31,28,31,30,31,30,31,31,30,31,30,31}; double EPS = 1e-14; const int MAX_V=100; const int MAX_N=100; char o[3]={'+','-','*'}; #define md 1000003 int bow[353][353]={0}; double add(double a,double b){ if(abs(a+b) convex_hull(P* ps, int n){ sort(ps,ps+n,cmp_x); int k=0; vector

qs(n*2); rep(i,n){ while(k>1&&(qs[k-1]-qs[k-2]).det(ps[i]-qs[k-1])<=0) k--; qs[k++]=ps[i]; } for(int i=n-2,t=k;i>=0;i--){ while(k>t&&(qs[k-1]-qs[k-2]).det(ps[i]-qs[k-1])<=0) k--; qs[k++]=ps[i]; } qs.resize(k-1); return qs; } int n,m; vector p; P ps[101]; */ //char c[520][520]; long long mod=1000000007; long long pow(ll i,ll j){ ll tmp=1; while(j){ if(j%2) tmp=tmp*i%mod; i=i*i%mod; j/=2; } return tmp; } int expression(State&); int term(State&); int factor(State&); int number(State&); int expression(State &begin){ int ret = term(begin); for(;;){ if(*begin == '+'){ begin++; ret += term(begin); } else if(*begin == '-'){ begin++; ret -= term(begin); } else break; } return ret; } int term(State &begin){ int ret = factor(begin); for(;;){ if(*begin=='*'){ begin++; ret *= factor(begin); } else if(*begin=='/'){ begin++; ret /= factor(begin); } else break; } return ret; } int factor(State &begin){ int ret; if(*begin == '('){ begin++; ret = expression(begin); begin++; } else ret = number(begin); return ret; } int number(State &begin){ int ret =0; while(isdigit(*begin)){ ret*=10; ret+=*begin - '0'; begin++; } return ret; } int main(void){ string s; cin>>s; cout<<"Hello World!"<