#include<bits/stdc++.h>
using namespace std;
using lint=long long;
int main(){
    int n=1000000;
    vector<pair<lint,lint>>v;
    for (int i=1;i<n;++i){
        for(int j=1;j<i;++j){
            if(gcd(i,j)!=1){
                continue;
            }
            if(v.size()==n-2)break;
            v.emplace_back(i-j,j);
        }
    }
    sort(v.begin(),v.end(),[](auto s,auto t){
            return s.first*t.second<s.second*t.first;
    });
    vector<pair<lint,lint>>ans;
    ans.emplace_back(0LL,0LL);
    for(auto [s,t]:v){
        ans.emplace_back(ans.back().first+s,ans.back ().second+t);
    }
    ans.emplace_back(ans.back().first,0LL);
    assert(ans.size()==n);
    for(auto [s,t]:ans){
        assert(s-1000000000LL<1000000000LL);
        assert(t-1000000000LL<1000000000LL);
        cout<<s-1000000000LL<<" "<<t-1000000000LL<<endl;
    }
}