//Project Euler #2: Even Fibonacci numbers
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;
int main(){
    int t;
    cin >> t;
    for(int i=0; i<t; i++){
        long n;
        cin >> n;
        long long int t1=1,t2=2,t3=0,sum=0;
        while(t1<n)
        {
            if(t1%2==0)
            {
                sum=sum+t1;
            }
            t3=t1+t2;
            t1=t2;
            t2=t3;

        }
        cout << sum << endl;
    }   return 0;
}