输入

3
3 4 5

输出

3

#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <bitset>using namespace std;
#define LL long long
#define pb push_back
#define mk make_pair
#define pill pair<int, int>
#define mst(a, b)    memset(a, b, sizeof a)
#define REP(i, x, n)    for(int i = x; i <= n; ++i)
int main(){int n;scanf("%d",&n);int a[6] = {};for(int i = 0 ; i < n ; i++){int x;scanf("%d",&x);a[x]++;}int sum = a[5];if(a[1] >= a[4]){sum += a[4];a[1] -= a[4];}else{sum += a[4];a[1] = 0;}if(a[2] >= a[3]){sum += a[3];a[2] -= a[3];}//如果2 比 3多 else{sum += a[2];a[3] -= a[2];a[2] = 0;int t = 2 * a[3];//a[3]可以带走多少a[1]if(a[1] >= t){sum += a[3];a[1] -= t;}else{sum += a[3];a[1] = 0;}}if(a[2] >= 0){int d1,d2;if(a[2] % 2 == 0){d1 = a[2] / 2;if(a[1] >= d1){sum += d1;a[1] -= d1;}else{sum += d1;a[1] = 0;}}else{d1 = a[2] / 2;d2 = 1;sum += 1;//无论怎么样多出来这一个2肯定要一辆车if(a[1] >= d1){sum += d1;a[1] -= d1;}else{sum += d1;a[1] = 0;}if(a[1] >= 3){a[1] -= 3;}else{a[1] = 0;}}}if(a[1] != 0){sum += (a[1]%5 == 0 ? a[1]/5 : a[1]/5 + 1);}printf("%d\n",sum);
}
/*
9
1 1 2 2 2 3 3 3 4
54
1 1 1 1
16
1 2 3 4 5 2
47
2 2 2 2 1 1 1
36
2 2 2 2 1 1
27
1 2 2 2 2 2 3
35
4 4 4 4 1
45
4 4 4 2 1
46
4 4 4 2 1 3
47
1 2 2 2 3 4 5
46
1 1 1 3 4 5
3
*/

#include<stdio.h>
typedef long long ll;
int main()
{ll n,m,x;scanf("%lld%lld",&n,&m);while(m--){scanf("%lld",&x);while(x%2==0)x=n+x/2;printf("%lld\n",(x+1)/2);}return 0;
}